About the Execution of LTSMin+red for ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 472.800 | 46190.00 | 65838.00 | 508.30 | FFFFFFTFFF?FT?TT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r329-tall-167889202500772.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r329-tall-167889202500772
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 422K Mar 5 18:23 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 1679170261086
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:11:02] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-18 20:11:02] [INFO ] Transformed 400 places.
[2023-03-18 20:11:02] [INFO ] Transformed 202 transitions.
[2023-03-18 20:11:02] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R100C002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 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 41 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2023-03-18 20:11:03] [INFO ] Computed 200 place invariants in 23 ms
[2023-03-18 20:11:03] [INFO ] Implicit Places using invariants in 477 ms returned [201, 203, 205, 207, 209, 211, 213, 215, 217, 221, 225, 227, 229, 233, 237, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 287, 289, 291, 295, 297, 301, 303, 307, 309, 311, 315, 319, 321, 323, 325, 327, 329, 331, 333, 335, 337, 341, 343, 345, 349, 351, 353, 357, 359, 361, 365, 367, 369, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391, 393, 395, 397]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 504 ms to find 83 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 317/400 places, 202/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 560 ms. Remains : 317/400 places, 202/202 transitions.
Support contains 69 out of 317 places after structural reductions.
[2023-03-18 20:11:03] [INFO ] Flatten gal took : 45 ms
[2023-03-18 20:11:03] [INFO ] Flatten gal took : 21 ms
[2023-03-18 20:11:04] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) 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 11) 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 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 35 ms. (steps per millisecond=285 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 202 rows 317 cols
[2023-03-18 20:11:04] [INFO ] Computed 117 place invariants in 7 ms
[2023-03-18 20:11:05] [INFO ] [Real]Absence check using 117 positive place invariants in 20 ms returned sat
[2023-03-18 20:11:05] [INFO ] After 279ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-18 20:11:05] [INFO ] After 320ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 20:11:05] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 20:11:05] [INFO ] [Nat]Absence check using 117 positive place invariants in 17 ms returned sat
[2023-03-18 20:11:06] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-18 20:11:06] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-18 20:11:06] [INFO ] After 839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 176 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=58 )
Parikh walk visited 10 properties in 50 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ResAllocation-PT-R100C002-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:06] [INFO ] Invariant cache hit.
[2023-03-18 20:11:07] [INFO ] Implicit Places using invariants in 187 ms returned [210, 213, 218, 221, 224, 248, 253, 257, 261, 266, 281, 286, 296, 301, 316]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 188 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 302/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s155 1) (GEQ s279 1) (GEQ s280 1)), p0:(AND (GEQ s117 1) (GEQ s259 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5456 steps with 6 reset in 163 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-01 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((G(p1)||F(p2))&&p0))&&G(F(p3)))))'
Support contains 10 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:07] [INFO ] Invariant cache hit.
[2023-03-18 20:11:07] [INFO ] Implicit Places using invariants in 379 ms returned [210, 213, 218, 221, 224, 248, 253, 257, 261, 269, 281, 286, 291, 301]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 380 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 303 /303 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 303/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 571 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s134 1) (GEQ s137 1)), p3:(AND (GEQ s113 1) (GEQ s257 1) (GEQ s258 1)), p1:(AND (GEQ s199 1) (GEQ s302 1)), p2:(AND (GEQ s163 1) (GEQ s283 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2550 steps with 0 reset in 27 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-04 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p0) U (!p1&&X(X(G(p1)))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:08] [INFO ] Invariant cache hit.
[2023-03-18 20:11:08] [INFO ] Implicit Places using invariants in 228 ms returned [210, 213, 221, 224, 248, 253, 257, 261, 266, 269, 281, 286, 291, 296, 301, 316]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 230 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 301/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s31 1) (GEQ s216 1) (GEQ s217 1)), p1:(AND (GEQ s46 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2554 steps with 0 reset in 29 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-05 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(F(p1)||G(p2)||X(p3))))'
Support contains 12 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:09] [INFO ] Invariant cache hit.
[2023-03-18 20:11:09] [INFO ] Implicit Places using invariants in 211 ms returned [213, 218, 224, 248, 257, 266, 269, 281, 286, 291, 296, 301, 316]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 213 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 304/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 p0) (AND p0 p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 p0) (AND p0 p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(OR (LT s93 1) (LT s249 1) (LT s250 1)), p1:(AND (GEQ s105 1) (GEQ s256 1) (GEQ s257 1)), p3:(AND (GEQ s35 1) (GEQ s219 1) (GEQ s220 1)), p2:(OR (LT s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18542 steps with 7 reset in 99 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-07 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:09] [INFO ] Invariant cache hit.
[2023-03-18 20:11:09] [INFO ] Implicit Places using invariants in 174 ms returned [210, 213, 218, 221, 224, 248, 253, 261, 266, 269, 281, 286, 291, 296, 301, 316]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 175 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 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 LTL mode , in 2 iterations and 182 ms. Remains : 301/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-09 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 (AND (GEQ s154 1) (GEQ s157 1)) (AND (GEQ s99 1) (GEQ s250 1) (GEQ s251 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 2 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-09 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U p1))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 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 315 transition count 200
Applied a total of 4 rules in 25 ms. Remains 315 /317 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 315 cols
[2023-03-18 20:11:10] [INFO ] Computed 117 place invariants in 4 ms
[2023-03-18 20:11:10] [INFO ] Implicit Places using invariants in 158 ms returned [208, 211, 216, 219, 222, 246, 251, 255, 259, 264, 267, 284, 289, 294, 299, 314]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 159 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/317 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 SI_LTL mode , in 2 iterations and 193 ms. Remains : 299/317 places, 200/202 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s82 1) (GEQ s85 1)), p0:(AND (GEQ s139 1) (GEQ s268 1) (GEQ s269 1))], nbAcceptance=2, 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 491 ms.
Product exploration explored 100000 steps with 38 reset in 544 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 470 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 834 steps, including 0 resets, run visited all 5 properties in 18 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 562 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 200 rows 299 cols
[2023-03-18 20:11:12] [INFO ] Computed 101 place invariants in 3 ms
[2023-03-18 20:11:13] [INFO ] [Real]Absence check using 101 positive place invariants in 26 ms returned sat
[2023-03-18 20:11:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:13] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2023-03-18 20:11:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:11:13] [INFO ] [Nat]Absence check using 101 positive place invariants in 26 ms returned sat
[2023-03-18 20:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:14] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2023-03-18 20:11:14] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 20:11:16] [INFO ] Added : 196 causal constraints over 40 iterations in 1147 ms. Result :sat
Could not prove EG (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 9 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:11:16] [INFO ] Invariant cache hit.
[2023-03-18 20:11:16] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-18 20:11:16] [INFO ] Invariant cache hit.
[2023-03-18 20:11:16] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-18 20:11:16] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 20:11:16] [INFO ] Invariant cache hit.
[2023-03-18 20:11:16] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 393 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 2984 steps, including 1 resets, run visited all 5 properties in 41 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 532 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
[2023-03-18 20:11:17] [INFO ] Invariant cache hit.
[2023-03-18 20:11:18] [INFO ] [Real]Absence check using 101 positive place invariants in 23 ms returned sat
[2023-03-18 20:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:18] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2023-03-18 20:11:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:11:18] [INFO ] [Nat]Absence check using 101 positive place invariants in 26 ms returned sat
[2023-03-18 20:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:19] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2023-03-18 20:11:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-18 20:11:19] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-18 20:11:20] [INFO ] Added : 193 causal constraints over 39 iterations in 955 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 38 reset in 432 ms.
Product exploration explored 100000 steps with 38 reset in 488 ms.
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 8 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:11:21] [INFO ] Invariant cache hit.
[2023-03-18 20:11:21] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-18 20:11:21] [INFO ] Invariant cache hit.
[2023-03-18 20:11:22] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-18 20:11:22] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 20:11:22] [INFO ] Invariant cache hit.
[2023-03-18 20:11:22] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 545 ms. Remains : 299/299 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-10 finished in 12248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 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 315 transition count 200
Applied a total of 4 rules in 14 ms. Remains 315 /317 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 315 cols
[2023-03-18 20:11:22] [INFO ] Computed 117 place invariants in 2 ms
[2023-03-18 20:11:22] [INFO ] Implicit Places using invariants in 151 ms returned [208, 216, 219, 222, 246, 251, 255, 259, 264, 267, 279, 284, 289, 294, 299, 314]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 154 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/317 places, 200/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 299/317 places, 200/202 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s210 1) (GEQ s211 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 2554 steps with 0 reset in 18 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-11 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((!p0||G(!p1)))||(!p2&&(!p0||G(!p1)))))))'
Support contains 8 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 317 cols
[2023-03-18 20:11:22] [INFO ] Computed 117 place invariants in 3 ms
[2023-03-18 20:11:22] [INFO ] Implicit Places using invariants in 172 ms returned [210, 213, 218, 221, 224, 253, 257, 261, 266, 269, 281, 286, 291, 296, 316]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 174 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 302/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND p0 p1), (AND p0 p1), p1]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s171 1) (GEQ s287 1) (GEQ s288 1)), p1:(AND (GEQ s126 1) (GEQ s129 1)), p2:(AND (GEQ s85 1) (GEQ s243 1) (GEQ s244 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Product exploration explored 100000 steps with 50000 reset in 404 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) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 9 factoid took 252 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-12 finished in 1431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(((p0 U !(p1 U !p2))||p1))))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:24] [INFO ] Invariant cache hit.
[2023-03-18 20:11:24] [INFO ] Implicit Places using invariants in 166 ms returned [210, 213, 218, 221, 224, 248, 253, 257, 266, 269, 281, 291, 296, 301, 316]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 167 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 302/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s105 1) (GEQ s253 1) (GEQ s254 1)), p2:(AND (GEQ s147 1) (GEQ s275 1) (GEQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 475 reset in 343 ms.
Product exploration explored 100000 steps with 476 reset in 401 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 p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 202 rows 302 cols
[2023-03-18 20:11:25] [INFO ] Computed 102 place invariants in 5 ms
[2023-03-18 20:11:25] [INFO ] [Real]Absence check using 102 positive place invariants in 27 ms returned sat
[2023-03-18 20:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:26] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2023-03-18 20:11:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:11:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2023-03-18 20:11:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:27] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2023-03-18 20:11:27] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2023-03-18 20:11:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2023-03-18 20:11:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2023-03-18 20:11:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-18 20:11:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 213 ms
[2023-03-18 20:11:28] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-18 20:11:29] [INFO ] Added : 192 causal constraints over 39 iterations in 966 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 302 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:29] [INFO ] Invariant cache hit.
[2023-03-18 20:11:29] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-18 20:11:29] [INFO ] Invariant cache hit.
[2023-03-18 20:11:29] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-18 20:11:29] [INFO ] Invariant cache hit.
[2023-03-18 20:11:29] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 302/302 places, 202/202 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 p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 235 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-18 20:11:30] [INFO ] Invariant cache hit.
[2023-03-18 20:11:30] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2023-03-18 20:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:30] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2023-03-18 20:11:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:11:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2023-03-18 20:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:32] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2023-03-18 20:11:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-18 20:11:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2023-03-18 20:11:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-18 20:11:32] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-18 20:11:33] [INFO ] Added : 196 causal constraints over 40 iterations in 953 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 496 reset in 341 ms.
Product exploration explored 100000 steps with 476 reset in 400 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 37 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-18 20:11:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 202 rows 302 cols
[2023-03-18 20:11:34] [INFO ] Computed 102 place invariants in 1 ms
[2023-03-18 20:11:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/302 places, 202/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 302/302 places, 202/202 transitions.
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 302 cols
[2023-03-18 20:11:34] [INFO ] Computed 102 place invariants in 1 ms
[2023-03-18 20:11:34] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-18 20:11:34] [INFO ] Invariant cache hit.
[2023-03-18 20:11:35] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-18 20:11:35] [INFO ] Invariant cache hit.
[2023-03-18 20:11:35] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 302/302 places, 202/202 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-13 finished in 11151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(((p0 U !(p1 U !p2))||p1))))))'
Found a Shortening insensitive property : ResAllocation-PT-R100C002-LTLFireability-13
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 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 315 transition count 200
Applied a total of 4 rules in 16 ms. Remains 315 /317 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 315 cols
[2023-03-18 20:11:35] [INFO ] Computed 117 place invariants in 4 ms
[2023-03-18 20:11:35] [INFO ] Implicit Places using invariants in 164 ms returned [208, 211, 216, 219, 222, 246, 251, 255, 264, 267, 279, 289, 294, 299, 314]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 167 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 300/317 places, 200/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 194 ms. Remains : 300/317 places, 200/202 transitions.
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s105 1) (GEQ s251 1) (GEQ s252 1)), p2:(AND (GEQ s147 1) (GEQ s273 1) (GEQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 482 reset in 339 ms.
Product exploration explored 100000 steps with 484 reset in 418 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 p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 119 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 200 rows 300 cols
[2023-03-18 20:11:37] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-18 20:11:37] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2023-03-18 20:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:37] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2023-03-18 20:11:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:11:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2023-03-18 20:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:38] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2023-03-18 20:11:38] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-18 20:11:40] [INFO ] Added : 196 causal constraints over 40 iterations in 1195 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:11:40] [INFO ] Invariant cache hit.
[2023-03-18 20:11:40] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-18 20:11:40] [INFO ] Invariant cache hit.
[2023-03-18 20:11:40] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-18 20:11:40] [INFO ] Invariant cache hit.
[2023-03-18 20:11:40] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 300/300 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 p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-18 20:11:41] [INFO ] Invariant cache hit.
[2023-03-18 20:11:41] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2023-03-18 20:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:42] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2023-03-18 20:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:11:42] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2023-03-18 20:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:11:43] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2023-03-18 20:11:43] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-18 20:11:44] [INFO ] Added : 196 causal constraints over 40 iterations in 1048 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 490 reset in 354 ms.
Product exploration explored 100000 steps with 488 reset in 411 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:11:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 20:11:45] [INFO ] Invariant cache hit.
[2023-03-18 20:11:45] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 300/300 places, 200/200 transitions.
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-18 20:11:45] [INFO ] Invariant cache hit.
[2023-03-18 20:11:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 20:11:45] [INFO ] Invariant cache hit.
[2023-03-18 20:11:45] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-18 20:11:45] [INFO ] Invariant cache hit.
[2023-03-18 20:11:45] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 300/300 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-13 finished in 10748 ms.
[2023-03-18 20:11:46] [INFO ] Flatten gal took : 17 ms
[2023-03-18 20:11:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-18 20:11:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 202 transitions and 834 arcs took 2 ms.
Total runtime 43488 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1456/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1456/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLFireability-10
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLFireability-13
BK_STOP 1679170307276
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ResAllocation-PT-R100C002-LTLFireability-10
ltl formula formula --ltl=/tmp/1456/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 317 places, 202 transitions and 834 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1456/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1456/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1456/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1456/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ResAllocation-PT-R100C002-LTLFireability-13
ltl formula formula --ltl=/tmp/1456/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 317 places, 202 transitions and 834 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1456/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1456/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1456/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1456/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r329-tall-167889202500772"
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 '
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 ;