About the Execution of ITS-Tools for PolyORBNT-PT-S05J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.500 | 3600000.00 | 5365014.00 | 392763.40 | FF?FFFTT?TFFFTFF | 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.r293-tall-167873945800716.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 itstools
Input is PolyORBNT-PT-S05J20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800716
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 18K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 294K Feb 25 23:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 83K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 402K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678949214011
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 06:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 06:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 06:46:55] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-16 06:46:55] [INFO ] Transformed 349 places.
[2023-03-16 06:46:55] [INFO ] Transformed 1210 transitions.
[2023-03-16 06:46:55] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2023-03-16 06:46:55] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-16 06:46:55] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 82 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 555/555 transitions.
Applied a total of 0 rules in 41 ms. Remains 349 /349 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-16 06:46:56] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-16 06:46:56] [INFO ] Computed 62 place invariants in 44 ms
[2023-03-16 06:46:56] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-16 06:46:56] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 349 cols
[2023-03-16 06:46:56] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-16 06:46:57] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-16 06:46:57] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2023-03-16 06:46:57] [INFO ] Invariant cache hit.
[2023-03-16 06:46:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:46:58] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 349/349 places, 460/555 transitions.
Applied a total of 0 rules in 25 ms. Remains 349 /349 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2638 ms. Remains : 349/349 places, 460/555 transitions.
Support contains 82 out of 349 places after structural reductions.
[2023-03-16 06:46:58] [INFO ] Flatten gal took : 73 ms
[2023-03-16 06:46:58] [INFO ] Flatten gal took : 52 ms
[2023-03-16 06:46:59] [INFO ] Input system was already deterministic with 460 transitions.
Incomplete random walk after 10000 steps, including 667 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 25) seen :20
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 182 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-16 06:46:59] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2023-03-16 06:46:59] [INFO ] Invariant cache hit.
[2023-03-16 06:46:59] [INFO ] [Real]Absence check using 43 positive place invariants in 8 ms returned sat
[2023-03-16 06:46:59] [INFO ] [Real]Absence check using 43 positive and 19 generalized place invariants in 24 ms returned sat
[2023-03-16 06:46:59] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((G((X(p0)&&(F(G(!p0))||p1)))&&X(G(p2))))'
Support contains 9 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 23 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:47:00] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-16 06:47:00] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 06:47:00] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
[2023-03-16 06:47:00] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:47:00] [INFO ] Invariant cache hit.
[2023-03-16 06:47:01] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-16 06:47:01] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:47:01] [INFO ] Invariant cache hit.
[2023-03-16 06:47:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:47:02] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2023-03-16 06:47:02] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:47:02] [INFO ] Invariant cache hit.
[2023-03-16 06:47:03] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2920 ms. Remains : 343/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s188 1) (GEQ s231 6) (GEQ s285 1) (GEQ s290 1) (GEQ s327 2)) (AND (GEQ s188 1) (GEQ s231 6) (GEQ s285 1) (GEQ s324 2) (GEQ s327 1)) (AND ...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-00 finished in 3203 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(!p1)) U (p0 U p2)))'
Support contains 32 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 319 transition count 435
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 50 place count 319 transition count 412
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 96 place count 296 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 295 transition count 411
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 295 transition count 411
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 2 with 4 rules applied. Total rules applied 102 place count 293 transition count 409
Applied a total of 102 rules in 65 ms. Remains 293 /349 variables (removed 56) and now considering 409/460 (removed 51) transitions.
[2023-03-16 06:47:03] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
// Phase 1: matrix 405 rows 293 cols
[2023-03-16 06:47:03] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 06:47:03] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
[2023-03-16 06:47:03] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
[2023-03-16 06:47:03] [INFO ] Invariant cache hit.
[2023-03-16 06:47:04] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-16 06:47:04] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
[2023-03-16 06:47:04] [INFO ] Invariant cache hit.
[2023-03-16 06:47:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:47:05] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2023-03-16 06:47:05] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-16 06:47:05] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
[2023-03-16 06:47:05] [INFO ] Invariant cache hit.
[2023-03-16 06:47:05] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/349 places, 409/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2337 ms. Remains : 293/349 places, 409/460 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s3 1) (GEQ s157 1) (GEQ s248 1)) (AND (GEQ s3 1) (GEQ s154 1) (GEQ s157 1)) (AND (GEQ s3 1) (GEQ s157 1) (GEQ s247 1)) (AND (GEQ s3 1) (G...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-01 finished in 2610 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' '!(G(F(p0)))'
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 319 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 318 transition count 434
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 52 place count 318 transition count 410
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 100 place count 294 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 293 transition count 409
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 293 transition count 409
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 3 with 4 rules applied. Total rules applied 106 place count 291 transition count 407
Applied a total of 106 rules in 47 ms. Remains 291 /349 variables (removed 58) and now considering 407/460 (removed 53) transitions.
[2023-03-16 06:47:06] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2023-03-16 06:47:06] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-16 06:47:06] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
[2023-03-16 06:47:06] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:06] [INFO ] Invariant cache hit.
[2023-03-16 06:47:06] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-16 06:47:06] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:06] [INFO ] Invariant cache hit.
[2023-03-16 06:47:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:47:08] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2023-03-16 06:47:08] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 06:47:08] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:08] [INFO ] Invariant cache hit.
[2023-03-16 06:47:09] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/349 places, 407/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2901 ms. Remains : 291/349 places, 407/460 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s51 1) (LT s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4995 reset in 485 ms.
Product exploration explored 100000 steps with 5074 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 19 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2023-03-16 06:47:10] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:10] [INFO ] Invariant cache hit.
[2023-03-16 06:47:10] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
[2023-03-16 06:47:10] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:10] [INFO ] Invariant cache hit.
[2023-03-16 06:47:11] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-16 06:47:11] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:11] [INFO ] Invariant cache hit.
[2023-03-16 06:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:47:12] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2023-03-16 06:47:12] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 06:47:12] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:12] [INFO ] Invariant cache hit.
[2023-03-16 06:47:13] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2424 ms. Remains : 291/291 places, 407/407 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 103 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5160 reset in 330 ms.
Product exploration explored 100000 steps with 5031 reset in 389 ms.
Built C files in :
/tmp/ltsmin2895709030629713926
[2023-03-16 06:47:14] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2023-03-16 06:47:14] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:47:14] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2023-03-16 06:47:14] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:47:14] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2023-03-16 06:47:14] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:47:14] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2895709030629713926
Running compilation step : cd /tmp/ltsmin2895709030629713926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1056 ms.
Running link step : cd /tmp/ltsmin2895709030629713926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin2895709030629713926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11109089453119292110.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 12 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2023-03-16 06:47:29] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:29] [INFO ] Invariant cache hit.
[2023-03-16 06:47:29] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
[2023-03-16 06:47:29] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:29] [INFO ] Invariant cache hit.
[2023-03-16 06:47:30] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-16 06:47:30] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:30] [INFO ] Invariant cache hit.
[2023-03-16 06:47:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:47:31] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
[2023-03-16 06:47:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 06:47:31] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:47:31] [INFO ] Invariant cache hit.
[2023-03-16 06:47:32] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2678 ms. Remains : 291/291 places, 407/407 transitions.
Built C files in :
/tmp/ltsmin14116544874858203847
[2023-03-16 06:47:32] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2023-03-16 06:47:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:47:32] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2023-03-16 06:47:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:47:32] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2023-03-16 06:47:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:47:32] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14116544874858203847
Running compilation step : cd /tmp/ltsmin14116544874858203847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1194 ms.
Running link step : cd /tmp/ltsmin14116544874858203847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14116544874858203847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased160026227473455833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 06:47:47] [INFO ] Flatten gal took : 29 ms
[2023-03-16 06:47:47] [INFO ] Flatten gal took : 26 ms
[2023-03-16 06:47:47] [INFO ] Time to serialize gal into /tmp/LTL16598170489781472935.gal : 5 ms
[2023-03-16 06:47:47] [INFO ] Time to serialize properties into /tmp/LTL2963025438321581816.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16598170489781472935.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6336535696375664829.hoa' '-atoms' '/tmp/LTL2963025438321581816.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2963025438321581816.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6336535696375664829.hoa
Detected timeout of ITS tools.
[2023-03-16 06:48:02] [INFO ] Flatten gal took : 26 ms
[2023-03-16 06:48:02] [INFO ] Flatten gal took : 24 ms
[2023-03-16 06:48:02] [INFO ] Time to serialize gal into /tmp/LTL15610777352858069560.gal : 5 ms
[2023-03-16 06:48:02] [INFO ] Time to serialize properties into /tmp/LTL15077715440308058081.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15610777352858069560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15077715440308058081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((place_462<1)||(NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : FG!"((place_462<1)||(NotifyEventJobQueuedE_1<1))"
Detected timeout of ITS tools.
[2023-03-16 06:48:17] [INFO ] Flatten gal took : 22 ms
[2023-03-16 06:48:17] [INFO ] Applying decomposition
[2023-03-16 06:48:17] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14902733099192901840.txt' '-o' '/tmp/graph14902733099192901840.bin' '-w' '/tmp/graph14902733099192901840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14902733099192901840.bin' '-l' '-1' '-v' '-w' '/tmp/graph14902733099192901840.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:48:17] [INFO ] Decomposing Gal with order
[2023-03-16 06:48:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:48:17] [INFO ] Removed a total of 421 redundant transitions.
[2023-03-16 06:48:17] [INFO ] Flatten gal took : 88 ms
[2023-03-16 06:48:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 10 ms.
[2023-03-16 06:48:17] [INFO ] Time to serialize gal into /tmp/LTL14650852176775172094.gal : 7 ms
[2023-03-16 06:48:17] [INFO ] Time to serialize properties into /tmp/LTL10279687967405005019.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14650852176775172094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10279687967405005019.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((u13.place_462<1)||(u13.NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : FG!"((u13.place_462<1)||(u13.NotifyEventJobQueuedE_1<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9918598838895511318
[2023-03-16 06:48:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9918598838895511318
Running compilation step : cd /tmp/ltsmin9918598838895511318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 689 ms.
Running link step : cd /tmp/ltsmin9918598838895511318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9918598838895511318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-02 finished in 101975 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)))'
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 30 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:48:48] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-16 06:48:48] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-16 06:48:48] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
[2023-03-16 06:48:48] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:48] [INFO ] Invariant cache hit.
[2023-03-16 06:48:48] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-16 06:48:48] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:48] [INFO ] Invariant cache hit.
[2023-03-16 06:48:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:48:51] [INFO ] Implicit Places using invariants and state equation in 2535 ms returned []
Implicit Place search using SMT with State Equation took 2829 ms to find 0 implicit places.
[2023-03-16 06:48:51] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:51] [INFO ] Invariant cache hit.
[2023-03-16 06:48:51] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3625 ms. Remains : 343/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s225 1) (LT s323 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 21636 steps with 1492 reset in 62 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-03 finished in 3806 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)||F((X(G(p2))&&p1))))'
Support contains 38 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 459
Applied a total of 2 rules in 13 ms. Remains 348 /349 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:48:51] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 348 cols
[2023-03-16 06:48:51] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-16 06:48:52] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
[2023-03-16 06:48:52] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:52] [INFO ] Invariant cache hit.
[2023-03-16 06:48:52] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-16 06:48:52] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:52] [INFO ] Invariant cache hit.
[2023-03-16 06:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:48:54] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
[2023-03-16 06:48:54] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:54] [INFO ] Invariant cache hit.
[2023-03-16 06:48:55] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3313 ms. Remains : 348/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s59 1) (LT s230 1)) (OR (LT s230 1) (LT s278 1))), p0:(OR (AND (GEQ s41 1) (GEQ s55 1) (GEQ s320 1)) (AND (GEQ s55 1) (GEQ s288 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-04 finished in 3563 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 U X((G(p2)||p1)))))))'
Support contains 26 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 16 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:48:55] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-16 06:48:55] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-16 06:48:55] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2023-03-16 06:48:55] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:55] [INFO ] Invariant cache hit.
[2023-03-16 06:48:56] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-16 06:48:56] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:56] [INFO ] Invariant cache hit.
[2023-03-16 06:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:48:58] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
[2023-03-16 06:48:58] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:48:58] [INFO ] Invariant cache hit.
[2023-03-16 06:48:58] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3135 ms. Remains : 343/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s181 1), p1:(OR (LT s225 1) (LT s323 1)), p2:(OR (AND (GEQ s90 1) (GEQ s106 1) (GEQ s315 1)) (AND (GEQ s106 1) (GEQ s283 1) (GEQ s315 1)) (AND (GE...], 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]]
Product exploration explored 100000 steps with 19996 reset in 313 ms.
Product exploration explored 100000 steps with 20037 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 06:49:00] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:00] [INFO ] Invariant cache hit.
[2023-03-16 06:49:00] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-16 06:49:00] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 12 ms returned sat
[2023-03-16 06:49:00] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-16 06:49:00] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-16 06:49:00] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 11 ms returned sat
[2023-03-16 06:49:09] [INFO ] After 8799ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F p2), (F (NOT p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 385 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 343 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 459/459 transitions.
Applied a total of 0 rules in 9 ms. Remains 343 /343 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2023-03-16 06:49:10] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:10] [INFO ] Invariant cache hit.
[2023-03-16 06:49:10] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
[2023-03-16 06:49:10] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:10] [INFO ] Invariant cache hit.
[2023-03-16 06:49:10] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-16 06:49:10] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:10] [INFO ] Invariant cache hit.
[2023-03-16 06:49:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:49:13] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
[2023-03-16 06:49:13] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:13] [INFO ] Invariant cache hit.
[2023-03-16 06:49:13] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3165 ms. Remains : 343/343 places, 459/459 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 p1 p0)]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 682 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 06:49:13] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:13] [INFO ] Invariant cache hit.
[2023-03-16 06:49:13] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2023-03-16 06:49:13] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 13 ms returned sat
[2023-03-16 06:49:13] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 06:49:13] [INFO ] [Nat]Absence check using 44 positive place invariants in 18 ms returned sat
[2023-03-16 06:49:13] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 10 ms returned sat
[2023-03-16 06:49:14] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 06:49:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:49:14] [INFO ] After 103ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 06:49:14] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-16 06:49:14] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 459/459 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 343 transition count 435
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 319 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 318 transition count 434
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 50 place count 318 transition count 410
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 98 place count 294 transition count 410
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 291 transition count 407
Applied a total of 104 rules in 34 ms. Remains 291 /343 variables (removed 52) and now considering 407/459 (removed 52) transitions.
[2023-03-16 06:49:14] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2023-03-16 06:49:14] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-16 06:49:15] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 291/343 places, 407/459 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 3272 steps with 234 reset in 7 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-05 finished in 20438 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' '!((G(p0) U X(!p1)))'
Support contains 35 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 459
Applied a total of 2 rules in 12 ms. Remains 348 /349 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:49:15] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 348 cols
[2023-03-16 06:49:15] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-16 06:49:16] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
[2023-03-16 06:49:16] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:16] [INFO ] Invariant cache hit.
[2023-03-16 06:49:16] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-16 06:49:16] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:16] [INFO ] Invariant cache hit.
[2023-03-16 06:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:49:18] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2023-03-16 06:49:18] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:49:18] [INFO ] Invariant cache hit.
[2023-03-16 06:49:18] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2940 ms. Remains : 348/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 164 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s150 1) (GEQ s195 1) (GEQ s236 1) (GEQ s345 1)) (AND (GEQ s80 1) (GEQ s150 1) (GEQ s153 1) (GEQ s236 1)) (AND (GEQ s95 1) (GEQ s120 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 477 ms.
Product exploration explored 100000 steps with 50000 reset in 501 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 170 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-06 finished in 4282 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(p0)))'
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 319 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 318 transition count 434
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 52 place count 318 transition count 410
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 100 place count 294 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 293 transition count 409
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 293 transition count 409
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 3 with 4 rules applied. Total rules applied 106 place count 291 transition count 407
Applied a total of 106 rules in 39 ms. Remains 291 /349 variables (removed 58) and now considering 407/460 (removed 53) transitions.
[2023-03-16 06:49:20] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2023-03-16 06:49:20] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-16 06:49:20] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
[2023-03-16 06:49:20] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:20] [INFO ] Invariant cache hit.
[2023-03-16 06:49:20] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-16 06:49:20] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:20] [INFO ] Invariant cache hit.
[2023-03-16 06:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:49:22] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2023-03-16 06:49:22] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 06:49:22] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:22] [INFO ] Invariant cache hit.
[2023-03-16 06:49:22] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/349 places, 407/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2431 ms. Remains : 291/349 places, 407/460 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s235 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5333 reset in 327 ms.
Product exploration explored 100000 steps with 5273 reset in 343 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 108 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 12 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2023-03-16 06:49:23] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:23] [INFO ] Invariant cache hit.
[2023-03-16 06:49:24] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
[2023-03-16 06:49:24] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:24] [INFO ] Invariant cache hit.
[2023-03-16 06:49:24] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-16 06:49:24] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:24] [INFO ] Invariant cache hit.
[2023-03-16 06:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:49:25] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-16 06:49:25] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 06:49:25] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:25] [INFO ] Invariant cache hit.
[2023-03-16 06:49:25] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1833 ms. Remains : 291/291 places, 407/407 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 1263 steps, including 68 resets, run visited all 1 properties in 7 ms. (steps per millisecond=180 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5258 reset in 334 ms.
Product exploration explored 100000 steps with 5259 reset in 342 ms.
Built C files in :
/tmp/ltsmin132990894907657717
[2023-03-16 06:49:26] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2023-03-16 06:49:26] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:49:26] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2023-03-16 06:49:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:49:26] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2023-03-16 06:49:26] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:49:26] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin132990894907657717
Running compilation step : cd /tmp/ltsmin132990894907657717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 914 ms.
Running link step : cd /tmp/ltsmin132990894907657717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin132990894907657717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11209119288049715323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 407/407 transitions.
Applied a total of 0 rules in 14 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2023-03-16 06:49:41] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:41] [INFO ] Invariant cache hit.
[2023-03-16 06:49:42] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
[2023-03-16 06:49:42] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:42] [INFO ] Invariant cache hit.
[2023-03-16 06:49:42] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-16 06:49:42] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:42] [INFO ] Invariant cache hit.
[2023-03-16 06:49:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:49:43] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2023-03-16 06:49:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 06:49:43] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2023-03-16 06:49:43] [INFO ] Invariant cache hit.
[2023-03-16 06:49:44] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2371 ms. Remains : 291/291 places, 407/407 transitions.
Built C files in :
/tmp/ltsmin13846947510264478372
[2023-03-16 06:49:44] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2023-03-16 06:49:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:49:44] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2023-03-16 06:49:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:49:44] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2023-03-16 06:49:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:49:44] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13846947510264478372
Running compilation step : cd /tmp/ltsmin13846947510264478372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 945 ms.
Running link step : cd /tmp/ltsmin13846947510264478372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13846947510264478372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14042498920718465727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 06:49:59] [INFO ] Flatten gal took : 20 ms
[2023-03-16 06:49:59] [INFO ] Flatten gal took : 18 ms
[2023-03-16 06:49:59] [INFO ] Time to serialize gal into /tmp/LTL13246429760365567462.gal : 4 ms
[2023-03-16 06:49:59] [INFO ] Time to serialize properties into /tmp/LTL12322104389257888096.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13246429760365567462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14293656716421557521.hoa' '-atoms' '/tmp/LTL12322104389257888096.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12322104389257888096.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14293656716421557521.hoa
Detected timeout of ITS tools.
[2023-03-16 06:50:14] [INFO ] Flatten gal took : 17 ms
[2023-03-16 06:50:14] [INFO ] Flatten gal took : 17 ms
[2023-03-16 06:50:14] [INFO ] Time to serialize gal into /tmp/LTL17485533193483446348.gal : 3 ms
[2023-03-16 06:50:14] [INFO ] Time to serialize properties into /tmp/LTL14309143962387842203.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17485533193483446348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14309143962387842203.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(FetchJobE_1_14<1)"))))
Formula 0 simplified : GF!"(FetchJobE_1_14<1)"
Detected timeout of ITS tools.
[2023-03-16 06:50:29] [INFO ] Flatten gal took : 21 ms
[2023-03-16 06:50:29] [INFO ] Applying decomposition
[2023-03-16 06:50:29] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17396544274246252839.txt' '-o' '/tmp/graph17396544274246252839.bin' '-w' '/tmp/graph17396544274246252839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17396544274246252839.bin' '-l' '-1' '-v' '-w' '/tmp/graph17396544274246252839.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:50:29] [INFO ] Decomposing Gal with order
[2023-03-16 06:50:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:50:29] [INFO ] Removed a total of 521 redundant transitions.
[2023-03-16 06:50:29] [INFO ] Flatten gal took : 51 ms
[2023-03-16 06:50:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 12 ms.
[2023-03-16 06:50:29] [INFO ] Time to serialize gal into /tmp/LTL5344388165994756842.gal : 7 ms
[2023-03-16 06:50:29] [INFO ] Time to serialize properties into /tmp/LTL12745905023337090950.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5344388165994756842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12745905023337090950.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i2.u6.FetchJobE_1_14<1)"))))
Formula 0 simplified : GF!"(i2.u6.FetchJobE_1_14<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18309850154429160205
[2023-03-16 06:50:44] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18309850154429160205
Running compilation step : cd /tmp/ltsmin18309850154429160205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 657 ms.
Running link step : cd /tmp/ltsmin18309850154429160205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin18309850154429160205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-08 finished in 99727 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)))'
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 14 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:50:59] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-16 06:50:59] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-16 06:51:00] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2023-03-16 06:51:00] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:51:00] [INFO ] Invariant cache hit.
[2023-03-16 06:51:00] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-16 06:51:00] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:51:00] [INFO ] Invariant cache hit.
[2023-03-16 06:51:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:51:02] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
[2023-03-16 06:51:02] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:51:02] [INFO ] Invariant cache hit.
[2023-03-16 06:51:03] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3375 ms. Remains : 343/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s47 3)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 619 steps with 43 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-10 finished in 3493 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&&(p1||X(p2))))))'
Support contains 8 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 345 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 344 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 344 transition count 459
Applied a total of 6 rules in 7 ms. Remains 344 /349 variables (removed 5) and now considering 459/460 (removed 1) transitions.
[2023-03-16 06:51:03] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 344 cols
[2023-03-16 06:51:03] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-16 06:51:03] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
[2023-03-16 06:51:03] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:51:03] [INFO ] Invariant cache hit.
[2023-03-16 06:51:04] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-16 06:51:04] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:51:04] [INFO ] Invariant cache hit.
[2023-03-16 06:51:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:51:06] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
[2023-03-16 06:51:06] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-16 06:51:06] [INFO ] Invariant cache hit.
[2023-03-16 06:51:06] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/349 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 344/349 places, 459/460 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s182 1), p1:(AND (GEQ s79 1) (GEQ s147 1) (GEQ s150 1) (GEQ s232 1)), p2:(AND (GEQ s3 1) (GEQ s35 1) (GEQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-11 finished in 3199 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&&G(p1))) U (F(p2) U p3)))'
Support contains 7 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 344 transition count 437
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 321 transition count 437
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 46 place count 321 transition count 412
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 96 place count 296 transition count 412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 295 transition count 411
Applied a total of 98 rules in 24 ms. Remains 295 /349 variables (removed 54) and now considering 411/460 (removed 49) transitions.
[2023-03-16 06:51:06] [INFO ] Flow matrix only has 407 transitions (discarded 4 similar events)
// Phase 1: matrix 407 rows 295 cols
[2023-03-16 06:51:06] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 06:51:06] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
[2023-03-16 06:51:06] [INFO ] Flow matrix only has 407 transitions (discarded 4 similar events)
[2023-03-16 06:51:06] [INFO ] Invariant cache hit.
[2023-03-16 06:51:07] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-16 06:51:07] [INFO ] Flow matrix only has 407 transitions (discarded 4 similar events)
[2023-03-16 06:51:07] [INFO ] Invariant cache hit.
[2023-03-16 06:51:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:51:08] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2023-03-16 06:51:08] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 06:51:08] [INFO ] Flow matrix only has 407 transitions (discarded 4 similar events)
[2023-03-16 06:51:08] [INFO ] Invariant cache hit.
[2023-03-16 06:51:09] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 295/349 places, 411/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2475 ms. Remains : 295/349 places, 411/460 transitions.
Stuttering acceptance computed with spot in 135 ms :[(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 : PolyORBNT-PT-S05J20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GEQ s235 1) (GEQ s288 1)), p2:(AND (GEQ s162 1) (GEQ s200 9) (GEQ s246 1)), p0:(LT s99 1), p1:(AND (NOT (AND (GEQ s162 1) (GEQ s200 9) (GEQ s246 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 903 steps with 42 reset in 7 ms.
FORMULA PolyORBNT-PT-S05J20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLFireability-12 finished in 2635 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' '!(G(F(p0)))'
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(p0)))'
[2023-03-16 06:51:09] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8151822193523261768
[2023-03-16 06:51:09] [INFO ] Computing symmetric may disable matrix : 460 transitions.
[2023-03-16 06:51:09] [INFO ] Applying decomposition
[2023-03-16 06:51:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:51:09] [INFO ] Computing symmetric may enable matrix : 460 transitions.
[2023-03-16 06:51:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:51:09] [INFO ] Flatten gal took : 24 ms
[2023-03-16 06:51:09] [INFO ] Computing Do-Not-Accords matrix : 460 transitions.
[2023-03-16 06:51:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 06:51:09] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8151822193523261768
Running compilation step : cd /tmp/ltsmin8151822193523261768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15813052077261315332.txt' '-o' '/tmp/graph15813052077261315332.bin' '-w' '/tmp/graph15813052077261315332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15813052077261315332.bin' '-l' '-1' '-v' '-w' '/tmp/graph15813052077261315332.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:51:09] [INFO ] Decomposing Gal with order
[2023-03-16 06:51:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:51:09] [INFO ] Removed a total of 539 redundant transitions.
[2023-03-16 06:51:09] [INFO ] Flatten gal took : 45 ms
[2023-03-16 06:51:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 7 ms.
[2023-03-16 06:51:09] [INFO ] Time to serialize gal into /tmp/LTLFireability16864694256197623448.gal : 8 ms
[2023-03-16 06:51:09] [INFO ] Time to serialize properties into /tmp/LTLFireability10685802422601022796.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16864694256197623448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10685802422601022796.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G(F("((i7.u19.place_462<1)||(i7.u19.NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : FG!"((i7.u19.place_462<1)||(i7.u19.NotifyEventJobQueuedE_1<1))"
Compilation finished in 1066 ms.
Running link step : cd /tmp/ltsmin8151822193523261768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8151822193523261768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.264: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.316: Initializing POR dependencies: labels 462, guards 460
pins2lts-mc-linux64( 6/ 8), 0.514: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.514: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 2.587: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 2.587: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 2.587: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 3.384: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.396: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 3.462: There are 464 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.462: State length is 350, there are 463 groups
pins2lts-mc-linux64( 0/ 8), 3.462: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.462: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.462: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 3.462: Visible groups: 0 / 463, labels: 1 / 464
pins2lts-mc-linux64( 0/ 8), 3.462: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 3.462: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 3.632: [Blue] ~65 levels ~960 states ~2712 transitions
pins2lts-mc-linux64( 5/ 8), 3.682: [Blue] ~65 levels ~1920 states ~4360 transitions
pins2lts-mc-linux64( 5/ 8), 3.785: [Blue] ~65 levels ~3840 states ~8032 transitions
pins2lts-mc-linux64( 4/ 8), 4.143: [Blue] ~52 levels ~7680 states ~14720 transitions
pins2lts-mc-linux64( 4/ 8), 4.911: [Blue] ~52 levels ~15360 states ~28864 transitions
pins2lts-mc-linux64( 4/ 8), 7.301: [Blue] ~52 levels ~30720 states ~57248 transitions
pins2lts-mc-linux64( 2/ 8), 10.111: [Blue] ~51 levels ~61440 states ~111968 transitions
pins2lts-mc-linux64( 2/ 8), 17.160: [Blue] ~51 levels ~122880 states ~221016 transitions
pins2lts-mc-linux64( 2/ 8), 25.567: [Blue] ~51 levels ~245760 states ~439720 transitions
pins2lts-mc-linux64( 4/ 8), 30.279: [Blue] ~57 levels ~491520 states ~892160 transitions
pins2lts-mc-linux64( 1/ 8), 39.034: [Blue] ~63 levels ~983040 states ~1743400 transitions
pins2lts-mc-linux64( 1/ 8), 62.359: [Blue] ~63 levels ~1966080 states ~3648536 transitions
pins2lts-mc-linux64( 2/ 8), 102.850: [Blue] ~55 levels ~3932160 states ~7358824 transitions
pins2lts-mc-linux64( 2/ 8), 174.463: [Blue] ~55 levels ~7864320 states ~14988744 transitions
pins2lts-mc-linux64( 4/ 8), 317.746: [Blue] ~57 levels ~15728640 states ~30129952 transitions
pins2lts-mc-linux64( 0/ 8), 693.659: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 693.735:
pins2lts-mc-linux64( 0/ 8), 693.735: Explored 26779636 states 75182974 transitions, fanout: 2.807
pins2lts-mc-linux64( 0/ 8), 693.735: Total exploration time 690.240 sec (690.160 sec minimum, 690.194 sec on average)
pins2lts-mc-linux64( 0/ 8), 693.735: States per second: 38798, Transitions per second: 108923
pins2lts-mc-linux64( 0/ 8), 693.735:
pins2lts-mc-linux64( 0/ 8), 693.735: State space has 26779622 states, 8403933 are accepting
pins2lts-mc-linux64( 0/ 8), 693.735: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 693.735: blue states: 26779636 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 693.735: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 693.735: all-red states: 8403933 (31.38%), bogus 144 (0.00%)
pins2lts-mc-linux64( 0/ 8), 693.736:
pins2lts-mc-linux64( 0/ 8), 693.736: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 693.736:
pins2lts-mc-linux64( 0/ 8), 693.736: Queue width: 8B, total height: 360, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 693.736: Tree memory: 460.3MB, 18.0 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 693.736: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 693.736: Stored 462 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 693.736: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 693.736: Est. total memory use: 460.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8151822193523261768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8151822193523261768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 07:12:37] [INFO ] Flatten gal took : 1855 ms
[2023-03-16 07:12:37] [INFO ] Time to serialize gal into /tmp/LTLFireability8013449382499991577.gal : 43 ms
[2023-03-16 07:12:37] [INFO ] Time to serialize properties into /tmp/LTLFireability2449361126107106867.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8013449382499991577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2449361126107106867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F("((place_462<1)||(NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : FG!"((place_462<1)||(NotifyEventJobQueuedE_1<1))"
Detected timeout of ITS tools.
[2023-03-16 07:34:08] [INFO ] Flatten gal took : 266 ms
[2023-03-16 07:34:09] [INFO ] Input system was already deterministic with 460 transitions.
[2023-03-16 07:34:09] [INFO ] Transformed 349 places.
[2023-03-16 07:34:09] [INFO ] Transformed 460 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 07:34:40] [INFO ] Time to serialize gal into /tmp/LTLFireability16199348737153661252.gal : 8 ms
[2023-03-16 07:34:40] [INFO ] Time to serialize properties into /tmp/LTLFireability10758944740826163451.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16199348737153661252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10758944740826163451.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((place_462<1)||(NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : FG!"((place_462<1)||(NotifyEventJobQueuedE_1<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 175124 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15952020 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J20, 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 r293-tall-167873945800716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 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 ;