Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600700.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R100C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600700
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 02:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 02:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 422K May 10 09:34 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 ResAllocation-PT-R100C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653088925463

Running Version 202205111006
[2022-05-20 23:22:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 23:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:22:06] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-20 23:22:06] [INFO ] Transformed 400 places.
[2022-05-20 23:22:07] [INFO ] Transformed 202 transitions.
[2022-05-20 23:22:07] [INFO ] Parsed PT model containing 400 places and 202 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ResAllocation-PT-R100C002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 40 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2022-05-20 23:22:07] [INFO ] Computed 200 place invariants in 20 ms
[2022-05-20 23:22:07] [INFO ] Implicit Places using invariants in 443 ms returned [201, 205, 207, 209, 211, 213, 217, 219, 221, 223, 225, 227, 229, 231, 235, 237, 239, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 285, 287, 289, 291, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 319, 321, 323, 327, 329, 331, 333, 335, 337, 345, 347, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391, 393, 395, 397, 399]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 487 ms to find 90 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 310/400 places, 202/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 310 /310 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 310/400 places, 202/202 transitions.
Support contains 44 out of 310 places after structural reductions.
[2022-05-20 23:22:07] [INFO ] Flatten gal took : 49 ms
[2022-05-20 23:22:07] [INFO ] Flatten gal took : 24 ms
[2022-05-20 23:22:07] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 41 out of 310 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 694 ms. (steps per millisecond=14 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 202 rows 310 cols
[2022-05-20 23:22:09] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-20 23:22:09] [INFO ] [Real]Absence check using 110 positive place invariants in 16 ms returned sat
[2022-05-20 23:22:09] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 23:22:09] [INFO ] [Nat]Absence check using 110 positive place invariants in 15 ms returned sat
[2022-05-20 23:22:09] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 23:22:09] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-20 23:22:10] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 520 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=130 )
Parikh walk visited 9 properties in 47 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(X(p0)) U X(G(X(p1)))) U p0))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 310 /310 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 310 cols
[2022-05-20 23:22:10] [INFO ] Computed 110 place invariants in 4 ms
[2022-05-20 23:22:10] [INFO ] Implicit Places using invariants in 205 ms returned [202, 209, 219, 234, 251, 268, 278, 280, 284]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 208 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/310 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 301/310 places, 202/202 transitions.
Stuttering acceptance computed with spot in 389 ms :[p0, true, (AND p0 p1), p1, (AND p1 p0), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s138 1) (GEQ s141 1)), p1:(OR (AND (GEQ s138 1) (GEQ s141 1) (GEQ s139 1) (GEQ s270 1) (GEQ s271 1)) (AND (GEQ s138 1) (GEQ s141 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 572 ms.
Product exploration explored 100000 steps with 33333 reset in 499 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 p1)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ResAllocation-PT-R100C002-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-02 finished in 1923 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(G(!F(p0))||G(p1))) U G(p2)))'
Support contains 9 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 308 transition count 200
Applied a total of 4 rules in 27 ms. Remains 308 /310 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 308 cols
[2022-05-20 23:22:12] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-20 23:22:12] [INFO ] Implicit Places using invariants in 208 ms returned [200, 207, 232, 249, 274, 276, 282]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 212 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/310 places, 200/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 301/310 places, 200/202 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s125 1) (GEQ s262 1) (GEQ s263 1)), p1:(AND (GEQ s33 1) (GEQ s215 1) (GEQ s216 1)), p0:(AND (GEQ s143 1) (GEQ s272 1) (GEQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 431 reset in 436 ms.
Product exploration explored 100000 steps with 428 reset in 546 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 538 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:14] [INFO ] Computed 103 place invariants in 3 ms
[2022-05-20 23:22:14] [INFO ] [Real]Absence check using 103 positive place invariants in 23 ms returned sat
[2022-05-20 23:22:14] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 23:22:15] [INFO ] [Nat]Absence check using 103 positive place invariants in 20 ms returned sat
[2022-05-20 23:22:15] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 23:22:15] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 23:22:15] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 517 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1)), (F p2), (F p0), (F p1)]
Knowledge based reduction with 11 factoid took 522 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:16] [INFO ] Computed 103 place invariants in 1 ms
[2022-05-20 23:22:16] [INFO ] [Real]Absence check using 103 positive place invariants in 29 ms returned sat
[2022-05-20 23:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:22:16] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2022-05-20 23:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:22:17] [INFO ] [Nat]Absence check using 103 positive place invariants in 27 ms returned sat
[2022-05-20 23:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:22:17] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2022-05-20 23:22:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-20 23:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-05-20 23:22:17] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 23:22:18] [INFO ] Added : 196 causal constraints over 40 iterations in 759 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 9 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:18] [INFO ] Computed 103 place invariants in 1 ms
[2022-05-20 23:22:18] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:18] [INFO ] Computed 103 place invariants in 2 ms
[2022-05-20 23:22:19] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2022-05-20 23:22:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:19] [INFO ] Computed 103 place invariants in 1 ms
[2022-05-20 23:22:19] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 428 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:19] [INFO ] Computed 103 place invariants in 1 ms
[2022-05-20 23:22:20] [INFO ] [Real]Absence check using 103 positive place invariants in 14 ms returned sat
[2022-05-20 23:22:20] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 23:22:20] [INFO ] [Nat]Absence check using 103 positive place invariants in 11 ms returned sat
[2022-05-20 23:22:20] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 23:22:20] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 23:22:20] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 517 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1)), (F p2), (F p0), (F p1)]
Knowledge based reduction with 11 factoid took 650 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
// Phase 1: matrix 200 rows 301 cols
[2022-05-20 23:22:21] [INFO ] Computed 103 place invariants in 2 ms
[2022-05-20 23:22:21] [INFO ] [Real]Absence check using 103 positive place invariants in 20 ms returned sat
[2022-05-20 23:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:22:21] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2022-05-20 23:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:22:22] [INFO ] [Nat]Absence check using 103 positive place invariants in 26 ms returned sat
[2022-05-20 23:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:22:22] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2022-05-20 23:22:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-20 23:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-05-20 23:22:22] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 23:22:23] [INFO ] Added : 196 causal constraints over 40 iterations in 939 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), p1, (NOT p0)]
Product exploration explored 100000 steps with 441 reset in 430 ms.
Product exploration explored 100000 steps with 417 reset in 450 ms.
Built C files in :
/tmp/ltsmin2844200606700619884
[2022-05-20 23:22:24] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2022-05-20 23:22:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:24] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2022-05-20 23:22:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:24] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2022-05-20 23:22:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:24] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2844200606700619884
Running compilation step : cd /tmp/ltsmin2844200606700619884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 644 ms.
Running link step : cd /tmp/ltsmin2844200606700619884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2844200606700619884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16469740016710258655.hoa' '--buchi-type=spotba'
LTSmin run took 1932 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R100C002-LTLFireability-03 finished in 15376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 308 transition count 200
Applied a total of 4 rules in 14 ms. Remains 308 /310 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 308 cols
[2022-05-20 23:22:27] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 23:22:27] [INFO ] Implicit Places using invariants in 303 ms returned [200, 217, 232, 249, 266, 274, 276, 278, 282]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 308 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/310 places, 200/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 299/310 places, 200/202 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s206 1) (GEQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2566 steps with 0 reset in 11 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-06 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(!p0)))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 308 transition count 200
Applied a total of 4 rules in 9 ms. Remains 308 /310 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 308 cols
[2022-05-20 23:22:27] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 23:22:28] [INFO ] Implicit Places using invariants in 149 ms returned [200, 207, 217, 232, 249, 266, 274, 276, 278, 282]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 162 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/310 places, 200/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 298/310 places, 200/202 transitions.
Stuttering acceptance computed with spot in 84 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s52 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 417 reset in 257 ms.
Product exploration explored 100000 steps with 410 reset in 294 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2022-05-20 23:22:29] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 23:22:29] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2022-05-20 23:22:29] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-20 23:22:29] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2022-05-20 23:22:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2022-05-20 23:22:29] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 23:22:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 298/298 places, 200/200 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Finished random walk after 220 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=110 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 417 reset in 361 ms.
Product exploration explored 100000 steps with 406 reset in 404 ms.
Built C files in :
/tmp/ltsmin268800240314988672
[2022-05-20 23:22:31] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2022-05-20 23:22:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:31] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2022-05-20 23:22:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:31] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2022-05-20 23:22:31] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:31] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin268800240314988672
Running compilation step : cd /tmp/ltsmin268800240314988672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin268800240314988672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin268800240314988672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15887771886713944161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2022-05-20 23:22:46] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 23:22:46] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2022-05-20 23:22:46] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 23:22:46] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2022-05-20 23:22:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 298 cols
[2022-05-20 23:22:46] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 23:22:46] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 298/298 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin9289326213312584077
[2022-05-20 23:22:46] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2022-05-20 23:22:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:46] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2022-05-20 23:22:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:46] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2022-05-20 23:22:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:22:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9289326213312584077
Running compilation step : cd /tmp/ltsmin9289326213312584077;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 322 ms.
Running link step : cd /tmp/ltsmin9289326213312584077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9289326213312584077;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17523157909060972369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:23:02] [INFO ] Flatten gal took : 27 ms
[2022-05-20 23:23:02] [INFO ] Flatten gal took : 21 ms
[2022-05-20 23:23:02] [INFO ] Time to serialize gal into /tmp/LTL12144834471578019823.gal : 11 ms
[2022-05-20 23:23:02] [INFO ] Time to serialize properties into /tmp/LTL7571163065127520070.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12144834471578019823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7571163065127520070.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1214483...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p_0_26<1)||(r_0_27<1))")))||(G("((p_0_26>=1)&&(r_0_27>=1))"))))
Formula 0 simplified : !(GF"((p_0_26<1)||(r_0_27<1))" | G"((p_0_26>=1)&&(r_0_27>=1))")
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2022-05-20 23:23:17] [INFO ] Flatten gal took : 35 ms
[2022-05-20 23:23:17] [INFO ] Applying decomposition
[2022-05-20 23:23:17] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2590292021720162931.txt' '-o' '/tmp/graph2590292021720162931.bin' '-w' '/tmp/graph2590292021720162931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2590292021720162931.bin' '-l' '-1' '-v' '-w' '/tmp/graph2590292021720162931.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:23:17] [INFO ] Decomposing Gal with order
[2022-05-20 23:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:23:17] [INFO ] Flatten gal took : 78 ms
[2022-05-20 23:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 23:23:17] [INFO ] Time to serialize gal into /tmp/LTL7352083724240982847.gal : 8 ms
[2022-05-20 23:23:17] [INFO ] Time to serialize properties into /tmp/LTL7764884399466439244.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7352083724240982847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7764884399466439244.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7352083...245
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i3.i1.i0.u26.p_0_26<1)||(i3.i1.i0.u27.r_0_27<1))")))||(G("((i3.i1.i0.u26.p_0_26>=1)&&(i3.i1.i0.u27.r_0_27>=1))"))))
Formula 0 simplified : !(GF"((i3.i1.i0.u26.p_0_26<1)||(i3.i1.i0.u27.r_0_27<1))" | G"((i3.i1.i0.u26.p_0_26>=1)&&(i3.i1.i0.u27.r_0_27>=1))")
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i14.t99_t100, Intersection with reachable at each step enabled. (destroyed/rev...189
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2001384750842977611
[2022-05-20 23:23:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2001384750842977611
Running compilation step : cd /tmp/ltsmin2001384750842977611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin2001384750842977611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2001384750842977611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[](!(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-07 finished in 79745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||p1))))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 310 /310 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 310 cols
[2022-05-20 23:23:47] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 23:23:47] [INFO ] Implicit Places using invariants in 168 ms returned [202, 209, 219, 251, 268, 276, 278, 280, 284]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 170 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/310 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 301/310 places, 202/202 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s126 1) (GEQ s129 1)), p0:(AND (GEQ s61 1) (GEQ s231 1) (GEQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2566 steps with 0 reset in 9 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-08 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&G(p2))))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 310 /310 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 310 cols
[2022-05-20 23:23:48] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 23:23:48] [INFO ] Implicit Places using invariants in 167 ms returned [202, 209, 219, 234, 251, 268, 276, 278, 280, 284]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 170 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/310 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 300/310 places, 202/202 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LT s148 1) (LT s151 1)), p0:(OR (AND (GEQ s148 1) (GEQ s151 1)) (NOT (AND (GEQ s118 1) (GEQ s121 1)))), p1:(AND (GEQ s184 1) (GEQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2719 steps with 0 reset in 10 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-09 finished in 352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 308 transition count 200
Applied a total of 4 rules in 13 ms. Remains 308 /310 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 308 cols
[2022-05-20 23:23:48] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 23:23:48] [INFO ] Implicit Places using invariants in 178 ms returned [200, 207, 217, 232, 249, 266, 274, 276, 278]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 183 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/310 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 299/310 places, 200/202 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s184 1) (LT s187 1)), p1:(OR (LT s149 1) (LT s273 1) (LT s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 38 reset in 366 ms.
Product exploration explored 100000 steps with 38 reset in 385 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:23:49] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:23:49] [INFO ] [Real]Absence check using 101 positive place invariants in 10 ms returned sat
[2022-05-20 23:23:49] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:23:49] [INFO ] [Nat]Absence check using 101 positive place invariants in 11 ms returned sat
[2022-05-20 23:23:49] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:23:49] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 23:23:49] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:23:50] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:23:50] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:23:50] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:23:50] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2022-05-20 23:23:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:23:50] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:23:50] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 299/299 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:23:51] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:23:51] [INFO ] [Real]Absence check using 101 positive place invariants in 12 ms returned sat
[2022-05-20 23:23:51] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:23:51] [INFO ] [Nat]Absence check using 101 positive place invariants in 13 ms returned sat
[2022-05-20 23:23:51] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:23:51] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 23:23:51] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 38 reset in 321 ms.
Product exploration explored 100000 steps with 38 reset in 346 ms.
Built C files in :
/tmp/ltsmin17998902141619860769
[2022-05-20 23:23:52] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2022-05-20 23:23:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:23:52] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2022-05-20 23:23:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:23:52] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2022-05-20 23:23:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:23:52] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17998902141619860769
Running compilation step : cd /tmp/ltsmin17998902141619860769;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 364 ms.
Running link step : cd /tmp/ltsmin17998902141619860769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17998902141619860769;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15192764914898426686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:24:07] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:24:07] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:24:07] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:24:08] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2022-05-20 23:24:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 299 cols
[2022-05-20 23:24:08] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-20 23:24:08] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 299/299 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin6612526382215005040
[2022-05-20 23:24:08] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2022-05-20 23:24:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:24:08] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2022-05-20 23:24:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:24:08] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2022-05-20 23:24:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:24:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6612526382215005040
Running compilation step : cd /tmp/ltsmin6612526382215005040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin6612526382215005040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6612526382215005040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7934535857171154558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:24:23] [INFO ] Flatten gal took : 14 ms
[2022-05-20 23:24:23] [INFO ] Flatten gal took : 13 ms
[2022-05-20 23:24:23] [INFO ] Time to serialize gal into /tmp/LTL8387282867557177348.gal : 2 ms
[2022-05-20 23:24:23] [INFO ] Time to serialize properties into /tmp/LTL10966494371649296428.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8387282867557177348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10966494371649296428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8387282...267
Read 1 LTL properties
Checking formula 0 : !((G((F("((p_0_92<1)||(r_0_93<1))"))&&(F(G("(((r_0_74<1)||(r_1_74<1))||(p_1_75<1))"))))))
Formula 0 simplified : !G(F"((p_0_92<1)||(r_0_93<1))" & FG"(((r_0_74<1)||(r_1_74<1))||(p_1_75<1))")
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2022-05-20 23:24:38] [INFO ] Flatten gal took : 12 ms
[2022-05-20 23:24:38] [INFO ] Applying decomposition
[2022-05-20 23:24:38] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2718741005512188045.txt' '-o' '/tmp/graph2718741005512188045.bin' '-w' '/tmp/graph2718741005512188045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2718741005512188045.bin' '-l' '-1' '-v' '-w' '/tmp/graph2718741005512188045.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:24:38] [INFO ] Decomposing Gal with order
[2022-05-20 23:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:24:38] [INFO ] Flatten gal took : 36 ms
[2022-05-20 23:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-20 23:24:38] [INFO ] Time to serialize gal into /tmp/LTL12048457472777955312.gal : 15 ms
[2022-05-20 23:24:38] [INFO ] Time to serialize properties into /tmp/LTL436766064447246039.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12048457472777955312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL436766064447246039.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1204845...245
Read 1 LTL properties
Checking formula 0 : !((G((F("((i12.i0.i0.u91.p_0_92<1)||(i12.i0.i0.u92.r_0_93<1))"))&&(F(G("(((i9.i1.i1.u73.r_0_74<1)||(i9.i1.i1.u99.r_1_74<1))||(i10.i0.i...178
Formula 0 simplified : !G(F"((i12.i0.i0.u91.p_0_92<1)||(i12.i0.i0.u92.r_0_93<1))" & FG"(((i9.i1.i1.u73.r_0_74<1)||(i9.i1.i1.u99.r_1_74<1))||(i10.i0.i0.u74....167
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.t102_t101, i12.i1.i1.t99_t100, Intersection with reachable at each step enabled. (d...201
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6924998013973932261
[2022-05-20 23:24:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6924998013973932261
Running compilation step : cd /tmp/ltsmin6924998013973932261;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin6924998013973932261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6924998013973932261;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-11 finished in 80369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||p0))&&X(p1))))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 310 /310 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 310 cols
[2022-05-20 23:25:08] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 23:25:08] [INFO ] Implicit Places using invariants in 139 ms returned [202, 209, 219, 234, 251, 268, 276, 280, 284]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 163 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/310 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 301/310 places, 202/202 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (LT s84 1) (LT s87 1)), p0:(OR (LT s141 1) (LT s271 1) (LT s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Product exploration explored 100000 steps with 33333 reset in 307 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), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0)))))
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ResAllocation-PT-R100C002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-13 finished in 952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 308 transition count 200
Applied a total of 4 rules in 7 ms. Remains 308 /310 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 308 cols
[2022-05-20 23:25:09] [INFO ] Computed 110 place invariants in 0 ms
[2022-05-20 23:25:09] [INFO ] Implicit Places using invariants in 125 ms returned [200, 207, 217, 232, 249, 266, 276, 278, 282]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 126 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/310 places, 200/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 299/310 places, 200/202 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s139 1) (GEQ s268 1) (GEQ s269 1)), p0:(AND (GEQ s126 1) (GEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2550 steps with 0 reset in 9 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-14 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 310 /310 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 310 cols
[2022-05-20 23:25:09] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-20 23:25:10] [INFO ] Implicit Places using invariants in 200 ms returned [202, 209, 219, 234, 251, 268, 276, 278, 280, 284]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 201 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/310 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 300/310 places, 202/202 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s30 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-15 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(!p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2022-05-20 23:25:10] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7796609053991612710
[2022-05-20 23:25:10] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2022-05-20 23:25:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:25:10] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2022-05-20 23:25:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:25:10] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2022-05-20 23:25:10] [INFO ] Applying decomposition
[2022-05-20 23:25:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:25:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7796609053991612710
Running compilation step : cd /tmp/ltsmin7796609053991612710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 23:25:10] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10707571562869076226.txt' '-o' '/tmp/graph10707571562869076226.bin' '-w' '/tmp/graph10707571562869076226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10707571562869076226.bin' '-l' '-1' '-v' '-w' '/tmp/graph10707571562869076226.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:25:10] [INFO ] Decomposing Gal with order
[2022-05-20 23:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:25:10] [INFO ] Flatten gal took : 31 ms
[2022-05-20 23:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 23:25:10] [INFO ] Time to serialize gal into /tmp/LTLFireability3243551162712562266.gal : 13 ms
[2022-05-20 23:25:10] [INFO ] Time to serialize properties into /tmp/LTLFireability17884424802880349322.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3243551162712562266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17884424802880349322.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !(((G(F("((i3.i1.i1.u26.p_0_26<1)||(i4.i0.i0.u27.r_0_27<1))")))||(G("((i3.i1.i1.u26.p_0_26>=1)&&(i4.i0.i0.u27.r_0_27>=1))"))))
Formula 0 simplified : !(GF"((i3.i1.i1.u26.p_0_26<1)||(i4.i0.i0.u27.r_0_27<1))" | G"((i3.i1.i1.u26.p_0_26>=1)&&(i4.i0.i0.u27.r_0_27>=1))")
Compilation finished in 528 ms.
Running link step : cd /tmp/ltsmin7796609053991612710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 19 ms.
Running LTSmin : cd /tmp/ltsmin7796609053991612710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[](!(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i12.i1.i1.u99.t100, Intersection with reachable at each step enabled. (destroyed...193
Computing Next relation with stutter on 99 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 205, guards 202
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.095: LTL layer: formula: ([](<>((LTLAPp0==true)))||[](!(LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.095: "([](<>((LTLAPp0==true)))||[](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.096: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.246: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.248: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.255: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.255: State length is 311, there are 207 groups
pins2lts-mc-linux64( 0/ 8), 0.255: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.255: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.255: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.255: Visible groups: 0 / 207, labels: 1 / 207
pins2lts-mc-linux64( 0/ 8), 0.255: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.255: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.431: [Blue] ~120 levels ~960 states ~5320 transitions
pins2lts-mc-linux64( 2/ 8), 0.596: [Blue] ~239 levels ~1920 states ~9720 transitions
pins2lts-mc-linux64( 2/ 8), 0.778: [Blue] ~475 levels ~3840 states ~17352 transitions
pins2lts-mc-linux64( 2/ 8), 1.057: [Blue] ~947 levels ~7680 states ~32584 transitions
pins2lts-mc-linux64( 2/ 8), 1.430: [Blue] ~1886 levels ~15360 states ~62952 transitions
pins2lts-mc-linux64( 7/ 8), 2.467: [Blue] ~2405 levels ~30720 states ~79576 transitions
pins2lts-mc-linux64( 3/ 8), 4.396: [Blue] ~3707 levels ~61440 states ~179552 transitions
pins2lts-mc-linux64( 1/ 8), 5.771: [Blue] ~2567 levels ~122880 states ~428280 transitions
pins2lts-mc-linux64( 1/ 8), 9.314: [Blue] ~2567 levels ~245760 states ~881768 transitions
pins2lts-mc-linux64( 3/ 8), 16.702: [Blue] ~3707 levels ~491520 states ~1642304 transitions
pins2lts-mc-linux64( 3/ 8), 27.495: [Blue] ~3707 levels ~983040 states ~3524648 transitions
pins2lts-mc-linux64( 3/ 8), 43.553: [Blue] ~3707 levels ~1966080 states ~7280088 transitions
pins2lts-mc-linux64( 3/ 8), 62.207: [Blue] ~3707 levels ~3932160 states ~15146704 transitions
pins2lts-mc-linux64( 0/ 8), 101.043: [Blue] ~3662 levels ~7864320 states ~30089104 transitions
pins2lts-mc-linux64( 0/ 8), 192.760: [Blue] ~3662 levels ~15728640 states ~67157608 transitions
pins2lts-mc-linux64( 5/ 8), 255.121: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 255.276:
pins2lts-mc-linux64( 0/ 8), 255.276: Explored 16980222 states 83119246 transitions, fanout: 4.895
pins2lts-mc-linux64( 0/ 8), 255.276: Total exploration time 255.000 sec (254.840 sec minimum, 254.896 sec on average)
pins2lts-mc-linux64( 0/ 8), 255.276: States per second: 66589, Transitions per second: 325958
pins2lts-mc-linux64( 0/ 8), 255.276:
pins2lts-mc-linux64( 0/ 8), 255.276: State space has 16155973 states, 3273285 are accepting
pins2lts-mc-linux64( 0/ 8), 255.276: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 255.276: blue states: 16980222 (105.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 255.277: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 255.277: all-red states: 3273285 (20.26%), bogus 43317 (0.27%)
pins2lts-mc-linux64( 0/ 8), 255.277:
pins2lts-mc-linux64( 0/ 8), 255.277: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 255.277:
pins2lts-mc-linux64( 0/ 8), 255.277: Queue width: 8B, total height: 25613, memory: 0.20MB
pins2lts-mc-linux64( 0/ 8), 255.277: Tree memory: 379.3MB, 24.6 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 255.277: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 255.277: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 255.277: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 255.277: Est. total memory use: 379.5MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7796609053991612710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7796609053991612710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 23:46:11] [INFO ] Flatten gal took : 9 ms
[2022-05-20 23:46:11] [INFO ] Time to serialize gal into /tmp/LTLFireability13493254001304289378.gal : 2 ms
[2022-05-20 23:46:11] [INFO ] Time to serialize properties into /tmp/LTLFireability581340180435887015.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13493254001304289378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability581340180435887015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 2 LTL properties
Checking formula 0 : !(((G(F("((p_0_26<1)||(r_0_27<1))")))||(G("((p_0_26>=1)&&(r_0_27>=1))"))))
Formula 0 simplified : !(GF"((p_0_26<1)||(r_0_27<1))" | G"((p_0_26>=1)&&(r_0_27>=1))")
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5160 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,51.6592,1522768,1,0,11634,9.90734e+06,438,5818,9950,9.58022e+06,28473
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((F("((p_0_92<1)||(r_0_93<1))"))&&(F(G("(((r_0_74<1)||(r_1_74<1))||(p_1_75<1))"))))))
Formula 1 simplified : !G(F"((p_0_92<1)||(r_0_93<1))" & FG"(((r_0_74<1)||(r_1_74<1))||(p_1_75<1))")
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
8863 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,140.287,2247276,1,0,24051,1.33838e+07,30,24802,4441,2.04471e+07,57499
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1606558 ms.

BK_STOP 1653090533410

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R100C002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572600700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;