Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998800428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998800428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1020K
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 12:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 63K Apr 29 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 330K Apr 29 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 336K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653116874757

Running Version 202205111006
[2022-05-21 07:07:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 07:07:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:07:58] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2022-05-21 07:07:58] [INFO ] Transformed 168 places.
[2022-05-21 07:07:58] [INFO ] Transformed 592 transitions.
[2022-05-21 07:07:58] [INFO ] Parsed PT model containing 168 places and 592 transitions in 571 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-PT-20-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 96 transition count 494
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 96 transition count 494
Applied a total of 80 rules in 61 ms. Remains 96 /168 variables (removed 72) and now considering 494/592 (removed 98) transitions.
// Phase 1: matrix 494 rows 96 cols
[2022-05-21 07:07:59] [INFO ] Computed 16 place invariants in 55 ms
[2022-05-21 07:07:59] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 494 rows 96 cols
[2022-05-21 07:07:59] [INFO ] Computed 16 place invariants in 16 ms
[2022-05-21 07:07:59] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
// Phase 1: matrix 494 rows 96 cols
[2022-05-21 07:07:59] [INFO ] Computed 16 place invariants in 11 ms
[2022-05-21 07:08:00] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/168 places, 494/592 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/168 places, 494/592 transitions.
Support contains 74 out of 96 places after structural reductions.
[2022-05-21 07:08:01] [INFO ] Flatten gal took : 228 ms
[2022-05-21 07:08:01] [INFO ] Flatten gal took : 161 ms
[2022-05-21 07:08:01] [INFO ] Input system was already deterministic with 494 transitions.
Incomplete random walk after 10003 steps, including 29 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 96 cols
[2022-05-21 07:08:02] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-21 07:08:02] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 11 ms returned sat
[2022-05-21 07:08:03] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-21 07:08:03] [INFO ] After 383ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-21 07:08:03] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 07:08:03] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 16 ms returned sat
[2022-05-21 07:08:03] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 07:08:03] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-21 07:08:03] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 136 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 14 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 494 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 96 transition count 494
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)))'
Support contains 26 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 468
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 468
Applied a total of 10 rules in 21 ms. Remains 91 /96 variables (removed 5) and now considering 468/494 (removed 26) transitions.
// Phase 1: matrix 468 rows 91 cols
[2022-05-21 07:08:04] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-21 07:08:04] [INFO ] Implicit Places using invariants in 130 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 468/494 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/96 places, 468/494 transitions.
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s50 1) (GEQ s58 1) (GEQ s61 1)) (AND (GEQ s50 1) (GEQ s58 1) (GEQ s62 1)) (AND (GEQ s47 1) (GEQ s50 1) (GEQ s60 1)) (AND (GEQ s47 1) (GEQ...], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-01 finished in 661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G((F(X(X(p0)))&&(p0 U !p0)))&&p1)))))'
Support contains 22 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 344
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 344
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 68 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 68 transition count 234
Applied a total of 56 rules in 21 ms. Remains 68 /96 variables (removed 28) and now considering 234/494 (removed 260) transitions.
// Phase 1: matrix 234 rows 68 cols
[2022-05-21 07:08:04] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-21 07:08:05] [INFO ] Implicit Places using invariants in 132 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 134 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/96 places, 234/494 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/96 places, 234/494 transitions.
Stuttering acceptance computed with spot in 419 ms :[true, true, true, true, true, (NOT p0), p0, true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s51 1) (GEQ s55 1)) (AND (GEQ s28 1) (GEQ s31 1) (GEQ s55 1)) (AND (GEQ s20 1) (GEQ s52 1) (GEQ s55 1)) (AND (GEQ s20 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-04 finished in 637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
Support contains 9 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Graph (complete) has 831 edges and 96 vertex of which 32 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.10 ms
Discarding 64 places :
Also discarding 414 output transitions
Drop transitions removed 414 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 27 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 27 transition count 52
Applied a total of 11 rules in 44 ms. Remains 27 /96 variables (removed 69) and now considering 52/494 (removed 442) transitions.
// Phase 1: matrix 52 rows 27 cols
[2022-05-21 07:08:05] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 07:08:05] [INFO ] Implicit Places using invariants in 67 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/96 places, 52/494 transitions.
Applied a total of 0 rules in 7 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 26/96 places, 52/494 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1)) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s3 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 8 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-05 finished in 206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)&&X(p0))))||F(p0))))'
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Graph (complete) has 831 edges and 96 vertex of which 68 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 158 output transitions
Drop transitions removed 158 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 210
Applied a total of 29 rules in 28 ms. Remains 54 /96 variables (removed 42) and now considering 210/494 (removed 284) transitions.
// Phase 1: matrix 210 rows 54 cols
[2022-05-21 07:08:05] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-21 07:08:05] [INFO ] Implicit Places using invariants in 102 ms returned [17, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 104 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/96 places, 210/494 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 209
Applied a total of 2 rules in 23 ms. Remains 51 /52 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:05] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 07:08:05] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:05] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:06] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/96 places, 209/494 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/96 places, 209/494 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s37 1) (GEQ s42 1)) (AND (GEQ s14 1) (GEQ s38 1) (GEQ s42 1)) (AND (GEQ s14 1) (GEQ s25 1) (GEQ s42 1)) (AND (GEQ s14 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2355 reset in 1361 ms.
Product exploration explored 100000 steps with 2295 reset in 1406 ms.
Computed a total of 51 stabilizing places and 209 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 209
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 169 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:09] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:10] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 16 ms returned sat
[2022-05-21 07:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:08:10] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-21 07:08:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:08:11] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 12 ms returned sat
[2022-05-21 07:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:08:11] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-21 07:08:11] [INFO ] Computed and/alt/rep : 92/752/92 causal constraints (skipped 113 transitions) in 54 ms.
[2022-05-21 07:08:11] [INFO ] Added : 37 causal constraints over 8 iterations in 333 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 209/209 transitions.
Applied a total of 0 rules in 13 ms. Remains 51 /51 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:11] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:11] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:11] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:12] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2022-05-21 07:08:12] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:12] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 209/209 transitions.
Computed a total of 51 stabilizing places and 209 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 209
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 169 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=169 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:13] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:13] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 16 ms returned sat
[2022-05-21 07:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:08:14] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-21 07:08:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:08:14] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 14 ms returned sat
[2022-05-21 07:08:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:08:14] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-21 07:08:14] [INFO ] Computed and/alt/rep : 92/752/92 causal constraints (skipped 113 transitions) in 49 ms.
[2022-05-21 07:08:15] [INFO ] Added : 37 causal constraints over 8 iterations in 285 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2306 reset in 1207 ms.
Product exploration explored 100000 steps with 2308 reset in 1320 ms.
Built C files in :
/tmp/ltsmin12426092990321481270
[2022-05-21 07:08:17] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2022-05-21 07:08:17] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:08:17] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2022-05-21 07:08:17] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:08:17] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2022-05-21 07:08:17] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:08:17] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12426092990321481270
Running compilation step : cd /tmp/ltsmin12426092990321481270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1387 ms.
Running link step : cd /tmp/ltsmin12426092990321481270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin12426092990321481270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17347595813803623549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 17 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 209/209 transitions.
Applied a total of 0 rules in 10 ms. Remains 51 /51 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:32] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 07:08:32] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:32] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 07:08:33] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-05-21 07:08:33] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 209 rows 51 cols
[2022-05-21 07:08:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 07:08:33] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 209/209 transitions.
Built C files in :
/tmp/ltsmin8861512503784022296
[2022-05-21 07:08:33] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2022-05-21 07:08:33] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:08:33] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2022-05-21 07:08:33] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:08:33] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2022-05-21 07:08:33] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:08:33] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8861512503784022296
Running compilation step : cd /tmp/ltsmin8861512503784022296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1067 ms.
Running link step : cd /tmp/ltsmin8861512503784022296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8861512503784022296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13841214073147877742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:08:48] [INFO ] Flatten gal took : 36 ms
[2022-05-21 07:08:48] [INFO ] Flatten gal took : 32 ms
[2022-05-21 07:08:48] [INFO ] Time to serialize gal into /tmp/LTL14097603214035473030.gal : 9 ms
[2022-05-21 07:08:48] [INFO ] Time to serialize properties into /tmp/LTL6699109211158004666.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14097603214035473030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6699109211158004666.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1409760...267
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((((((((aux12_4>=1)&&(aux10_5>=1))&&(c15>=1))||(((aux12_1>=1)&&(aux10_6>=1))&&(c15>=1)))||((((aux12_1>=1)&&(aux10_4>=1)...8498
Formula 0 simplified : !F(GF(G"(((((((((aux12_4>=1)&&(aux10_5>=1))&&(c15>=1))||(((aux12_1>=1)&&(aux10_6>=1))&&(c15>=1)))||((((aux12_1>=1)&&(aux10_4>=1))&&(...8482
Detected timeout of ITS tools.
[2022-05-21 07:09:03] [INFO ] Flatten gal took : 32 ms
[2022-05-21 07:09:03] [INFO ] Applying decomposition
[2022-05-21 07:09:03] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11465949152530452400.txt' '-o' '/tmp/graph11465949152530452400.bin' '-w' '/tmp/graph11465949152530452400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11465949152530452400.bin' '-l' '-1' '-v' '-w' '/tmp/graph11465949152530452400.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:09:03] [INFO ] Decomposing Gal with order
[2022-05-21 07:09:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:09:03] [INFO ] Removed a total of 15 redundant transitions.
[2022-05-21 07:09:03] [INFO ] Flatten gal took : 132 ms
[2022-05-21 07:09:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-21 07:09:03] [INFO ] Time to serialize gal into /tmp/LTL7977153547329187705.gal : 7 ms
[2022-05-21 07:09:03] [INFO ] Time to serialize properties into /tmp/LTL13022939633245249574.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7977153547329187705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13022939633245249574.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7977153...246
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((((((((u2.aux12_4>=1)&&(u2.aux10_5>=1))&&(u2.c15>=1))||(((u2.aux12_1>=1)&&(u2.aux10_6>=1))&&(u2.c15>=1)))||((((u2.aux1...10226
Formula 0 simplified : !F(GF(G"(((((((((u2.aux12_4>=1)&&(u2.aux10_5>=1))&&(u2.c15>=1))||(((u2.aux12_1>=1)&&(u2.aux10_6>=1))&&(u2.c15>=1)))||((((u2.aux12_1>...10210
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12454953676788007833
[2022-05-21 07:09:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12454953676788007833
Running compilation step : cd /tmp/ltsmin12454953676788007833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1268 ms.
Running link step : cd /tmp/ltsmin12454953676788007833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12454953676788007833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(([]((LTLAPp0==true))&&X((LTLAPp0==true)))))||<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-LTLFireability-06 finished in 88416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Graph (complete) has 831 edges and 96 vertex of which 32 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 414 output transitions
Drop transitions removed 414 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 27 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 27 transition count 52
Applied a total of 11 rules in 8 ms. Remains 27 /96 variables (removed 69) and now considering 52/494 (removed 442) transitions.
// Phase 1: matrix 52 rows 27 cols
[2022-05-21 07:09:34] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 07:09:34] [INFO ] Implicit Places using invariants in 61 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/96 places, 52/494 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 26/96 places, 52/494 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-07 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 (AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1)) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s3 1) (GE...], 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 3754 reset in 653 ms.
Product exploration explored 100000 steps with 3749 reset in 692 ms.
Computed a total of 26 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 824 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 127 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:37] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-21 07:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:09:37] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-21 07:09:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:09:37] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-21 07:09:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:09:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-21 07:09:37] [INFO ] Computed and/alt/rep : 32/172/32 causal constraints (skipped 16 transitions) in 28 ms.
[2022-05-21 07:09:37] [INFO ] Added : 21 causal constraints over 5 iterations in 96 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:37] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:37] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-21 07:09:37] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-21 07:09:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:37] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 52/52 transitions.
Computed a total of 26 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 127 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:38] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-21 07:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:09:38] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-21 07:09:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:09:38] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-21 07:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:09:38] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-05-21 07:09:38] [INFO ] Computed and/alt/rep : 32/172/32 causal constraints (skipped 16 transitions) in 11 ms.
[2022-05-21 07:09:39] [INFO ] Added : 21 causal constraints over 5 iterations in 82 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3752 reset in 649 ms.
Product exploration explored 100000 steps with 3755 reset in 573 ms.
Built C files in :
/tmp/ltsmin6149513814506682719
[2022-05-21 07:09:40] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-21 07:09:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:09:40] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-21 07:09:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:09:40] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-21 07:09:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:09:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6149513814506682719
Running compilation step : cd /tmp/ltsmin6149513814506682719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 343 ms.
Running link step : cd /tmp/ltsmin6149513814506682719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6149513814506682719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4553040580570157689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:55] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:55] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-21 07:09:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 26 cols
[2022-05-21 07:09:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-21 07:09:55] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin13800245778555693014
[2022-05-21 07:09:55] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-21 07:09:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:09:55] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-21 07:09:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:09:55] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-21 07:09:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:09:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13800245778555693014
Running compilation step : cd /tmp/ltsmin13800245778555693014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 305 ms.
Running link step : cd /tmp/ltsmin13800245778555693014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13800245778555693014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12597465791659861744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:10:10] [INFO ] Flatten gal took : 7 ms
[2022-05-21 07:10:10] [INFO ] Flatten gal took : 6 ms
[2022-05-21 07:10:10] [INFO ] Time to serialize gal into /tmp/LTL5351787180109668791.gal : 2 ms
[2022-05-21 07:10:10] [INFO ] Time to serialize properties into /tmp/LTL1700082051465221206.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5351787180109668791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1700082051465221206.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5351787...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((c12>=1)&&(aux6_5>=1))&&(aux8_2>=1))||(((c12>=1)&&(aux8_3>=1))&&(aux6_4>=1)))||((((c12>=1)&&(aux8_3>=1))&&(aux6_1>=1))||...702
Formula 0 simplified : !GF"(((((((c12>=1)&&(aux6_5>=1))&&(aux8_2>=1))||(((c12>=1)&&(aux8_3>=1))&&(aux6_4>=1)))||((((c12>=1)&&(aux8_3>=1))&&(aux6_1>=1))||((...696
Detected timeout of ITS tools.
[2022-05-21 07:10:25] [INFO ] Flatten gal took : 7 ms
[2022-05-21 07:10:25] [INFO ] Applying decomposition
[2022-05-21 07:10:25] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17450722746706987126.txt' '-o' '/tmp/graph17450722746706987126.bin' '-w' '/tmp/graph17450722746706987126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17450722746706987126.bin' '-l' '-1' '-v' '-w' '/tmp/graph17450722746706987126.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:10:25] [INFO ] Decomposing Gal with order
[2022-05-21 07:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:10:25] [INFO ] Removed a total of 4 redundant transitions.
[2022-05-21 07:10:25] [INFO ] Flatten gal took : 13 ms
[2022-05-21 07:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2022-05-21 07:10:25] [INFO ] Time to serialize gal into /tmp/LTL11848556851302585262.gal : 2 ms
[2022-05-21 07:10:25] [INFO ] Time to serialize properties into /tmp/LTL6542698684435292734.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11848556851302585262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6542698684435292734.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1184855...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((u0.c12>=1)&&(u0.aux6_5>=1))&&(u0.aux8_2>=1))||(((u0.c12>=1)&&(u0.aux8_3>=1))&&(u0.aux6_4>=1)))||((((u0.c12>=1)&&(u0.aux...846
Formula 0 simplified : !GF"(((((((u0.c12>=1)&&(u0.aux6_5>=1))&&(u0.aux8_2>=1))||(((u0.c12>=1)&&(u0.aux8_3>=1))&&(u0.aux6_4>=1)))||((((u0.c12>=1)&&(u0.aux8_...840
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16145916177796702332
[2022-05-21 07:10:40] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16145916177796702332
Running compilation step : cd /tmp/ltsmin16145916177796702332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin16145916177796702332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16145916177796702332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-LTLFireability-07 finished in 81943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0))&&X(p1)) U p2))'
Support contains 9 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 52 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 72 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 59 transition count 128
Applied a total of 74 rules in 9 ms. Remains 59 /96 variables (removed 37) and now considering 128/494 (removed 366) transitions.
// Phase 1: matrix 128 rows 59 cols
[2022-05-21 07:10:56] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-21 07:10:56] [INFO ] Implicit Places using invariants in 94 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/96 places, 128/494 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/96 places, 128/494 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), true, (NOT p2), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (NOT (AND (GEQ s39 1) (GEQ s42 1) (GEQ s52 1))) (AND (GEQ s34 1) (GEQ s36 1) (GEQ s44 1))), p2:(AND (GEQ s34 1) (GEQ s36 1) (GEQ s44 1)), p1:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-08 finished in 278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&F(X(p2))&&p0)))'
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 52 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 72 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 58 transition count 120
Applied a total of 76 rules in 13 ms. Remains 58 /96 variables (removed 38) and now considering 120/494 (removed 374) transitions.
// Phase 1: matrix 120 rows 58 cols
[2022-05-21 07:10:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-21 07:10:56] [INFO ] Implicit Places using invariants in 88 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/96 places, 120/494 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/96 places, 120/494 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (LT s50 1) (LT s54 1) (LT s55 1) (LT s1 1) (LT s3 1) (LT s4 1)), p2:(OR (LT s1 1) (LT s3 1) (LT s4 1)), p0:(AND (GEQ s50 1) (GEQ s54 1) (GEQ s55 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 424 steps with 1 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-09 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p0)||p0) U X(p1)))))'
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 352
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 51 place count 61 transition count 140
Iterating global reduction 0 with 19 rules applied. Total rules applied 70 place count 61 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 59 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 59 transition count 124
Applied a total of 74 rules in 6 ms. Remains 59 /96 variables (removed 37) and now considering 124/494 (removed 370) transitions.
// Phase 1: matrix 124 rows 59 cols
[2022-05-21 07:10:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-21 07:10:56] [INFO ] Implicit Places using invariants in 113 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/96 places, 124/494 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/96 places, 124/494 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 1)), p1:(AND (GEQ s20 1) (GEQ s30 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 411 steps with 1 reset in 6 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-12 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Graph (complete) has 831 edges and 96 vertex of which 86 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 75 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 75 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 45 place count 53 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 67 place count 53 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 69 place count 51 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 71 place count 51 transition count 102
Applied a total of 71 rules in 31 ms. Remains 51 /96 variables (removed 45) and now considering 102/494 (removed 392) transitions.
// Phase 1: matrix 102 rows 51 cols
[2022-05-21 07:10:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:10:57] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 102 rows 51 cols
[2022-05-21 07:10:57] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:10:57] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2022-05-21 07:10:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 51 cols
[2022-05-21 07:10:57] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:10:57] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/96 places, 102/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/96 places, 102/494 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s3 1) (LT s5 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 355 reset in 796 ms.
Product exploration explored 100000 steps with 355 reset in 612 ms.
Computed a total of 51 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-PT-20-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-13 finished in 2126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 494/494 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 344
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 60 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 84 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 52 transition count 92
Applied a total of 88 rules in 6 ms. Remains 52 /96 variables (removed 44) and now considering 92/494 (removed 402) transitions.
// Phase 1: matrix 92 rows 52 cols
[2022-05-21 07:10:59] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-21 07:10:59] [INFO ] Implicit Places using invariants in 70 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/96 places, 92/494 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/96 places, 92/494 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s25 1)), p0:(AND (GEQ s31 1) (GEQ s33 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-14 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)&&X(p0))))||F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-21 07:10:59] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17272867820821758595
[2022-05-21 07:10:59] [INFO ] Computing symmetric may disable matrix : 494 transitions.
[2022-05-21 07:10:59] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:10:59] [INFO ] Computing symmetric may enable matrix : 494 transitions.
[2022-05-21 07:10:59] [INFO ] Applying decomposition
[2022-05-21 07:10:59] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:10:59] [INFO ] Flatten gal took : 83 ms
[2022-05-21 07:10:59] [INFO ] Computing Do-Not-Accords matrix : 494 transitions.
[2022-05-21 07:10:59] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:10:59] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17272867820821758595
Running compilation step : cd /tmp/ltsmin17272867820821758595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7142268543136365846.txt' '-o' '/tmp/graph7142268543136365846.bin' '-w' '/tmp/graph7142268543136365846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7142268543136365846.bin' '-l' '-1' '-v' '-w' '/tmp/graph7142268543136365846.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:11:00] [INFO ] Decomposing Gal with order
[2022-05-21 07:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:11:00] [INFO ] Removed a total of 366 redundant transitions.
[2022-05-21 07:11:00] [INFO ] Flatten gal took : 227 ms
[2022-05-21 07:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 37 ms.
[2022-05-21 07:11:00] [INFO ] Time to serialize gal into /tmp/LTLFireability6353183598659724670.gal : 10 ms
[2022-05-21 07:11:00] [INFO ] Time to serialize properties into /tmp/LTLFireability11048459562232454657.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6353183598659724670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11048459562232454657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((F((G(F((G("(((((((((u2.aux12_4>=1)&&(u2.aux10_5>=1))&&(u3.c15>=1))||(((u2.aux12_1>=1)&&(u2.aux10_6>=1))&&(u3.c15>=1)))||((((u2.aux1...10226
Formula 0 simplified : !F(GF(G"(((((((((u2.aux12_4>=1)&&(u2.aux10_5>=1))&&(u3.c15>=1))||(((u2.aux12_1>=1)&&(u2.aux10_6>=1))&&(u3.c15>=1)))||((((u2.aux12_1>...10210
Compilation finished in 2530 ms.
Running link step : cd /tmp/ltsmin17272867820821758595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17272867820821758595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(([]((LTLAPp0==true))&&X((LTLAPp0==true)))))||<>((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-21 07:32:01] [INFO ] Flatten gal took : 176 ms
[2022-05-21 07:32:01] [INFO ] Time to serialize gal into /tmp/LTLFireability7894329656609059551.gal : 6 ms
[2022-05-21 07:32:01] [INFO ] Time to serialize properties into /tmp/LTLFireability11581209992650253397.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7894329656609059551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11581209992650253397.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((F((G(F((G("(((((((((aux12_4>=1)&&(aux10_5>=1))&&(c15>=1))||(((aux12_1>=1)&&(aux10_6>=1))&&(c15>=1)))||((((aux12_1>=1)&&(aux10_4>=1)...8498
Formula 0 simplified : !F(GF(G"(((((((((aux12_4>=1)&&(aux10_5>=1))&&(c15>=1))||(((aux12_1>=1)&&(aux10_6>=1))&&(c15>=1)))||((((aux12_1>=1)&&(aux10_4>=1))&&(...8482
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: LTL layer: formula: <>(([](<>(([]((LTLAPp0==true))&&X((LTLAPp0==true)))))||<>((LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.017: "<>(([](<>(([]((LTLAPp0==true))&&X((LTLAPp0==true)))))||<>((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.129: DFS-FIFO for weak LTL, using special progress label 497
pins2lts-mc-linux64( 0/ 8), 0.129: There are 498 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.129: State length is 97, there are 495 groups
pins2lts-mc-linux64( 0/ 8), 0.129: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.129: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.129: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.129: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.743: ~84 levels ~960 states ~24000 transitions
pins2lts-mc-linux64( 5/ 8), 1.010: ~122 levels ~1920 states ~35472 transitions
pins2lts-mc-linux64( 1/ 8), 1.214: ~166 levels ~3840 states ~67296 transitions
pins2lts-mc-linux64( 1/ 8), 1.369: ~182 levels ~7680 states ~78432 transitions
pins2lts-mc-linux64( 1/ 8), 1.488: ~182 levels ~15360 states ~86048 transitions
pins2lts-mc-linux64( 1/ 8), 1.709: ~182 levels ~30720 states ~101088 transitions
pins2lts-mc-linux64( 1/ 8), 2.250: ~182 levels ~61440 states ~131968 transitions
pins2lts-mc-linux64( 2/ 8), 3.067: ~182 levels ~122880 states ~193048 transitions
pins2lts-mc-linux64( 2/ 8), 4.493: ~182 levels ~245760 states ~317816 transitions
pins2lts-mc-linux64( 2/ 8), 7.507: ~182 levels ~491520 states ~569520 transitions
pins2lts-mc-linux64( 6/ 8), 12.483: ~182 levels ~983040 states ~1087272 transitions
pins2lts-mc-linux64( 6/ 8), 21.491: ~182 levels ~1966080 states ~2147408 transitions
pins2lts-mc-linux64( 0/ 8), 39.248: ~182 levels ~3932160 states ~4220600 transitions
pins2lts-mc-linux64( 4/ 8), 74.774: ~182 levels ~7864320 states ~8375520 transitions
pins2lts-mc-linux64( 6/ 8), 145.770: ~182 levels ~15728640 states ~16629192 transitions
pins2lts-mc-linux64( 6/ 8), 286.436: ~182 levels ~31457280 states ~33415600 transitions
pins2lts-mc-linux64( 6/ 8), 569.367: ~182 levels ~62914560 states ~66764576 transitions
pins2lts-mc-linux64( 6/ 8), 1142.999: ~182 levels ~125829120 states ~134138360 transitions
pins2lts-mc-linux64( 1/ 8), 1263.759: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1264.418:
pins2lts-mc-linux64( 0/ 8), 1264.418: mean standard work distribution: 1.6% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1264.418:
pins2lts-mc-linux64( 0/ 8), 1264.418: Explored 134147814 states 144249964 transitions, fanout: 1.075
pins2lts-mc-linux64( 0/ 8), 1264.418: Total exploration time 1264.270 sec (1263.720 sec minimum, 1263.971 sec on average)
pins2lts-mc-linux64( 0/ 8), 1264.418: States per second: 106107, Transitions per second: 114097
pins2lts-mc-linux64( 0/ 8), 1264.418:
pins2lts-mc-linux64( 0/ 8), 1264.418: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1264.418: Redundant explorations: -0.0518
pins2lts-mc-linux64( 0/ 8), 1264.418:
pins2lts-mc-linux64( 0/ 8), 1264.418: Queue width: 8B, total height: 1464, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1264.418: Tree memory: 1252.4MB, 9.8 B/state, compr.: 2.5%
pins2lts-mc-linux64( 0/ 8), 1264.418: Tree fill ratio (roots/leafs): 99.0%/89.0%
pins2lts-mc-linux64( 0/ 8), 1264.418: Stored 534 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1264.418: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1264.418: Est. total memory use: 1252.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17272867820821758595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(([]((LTLAPp0==true))&&X((LTLAPp0==true)))))||<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17272867820821758595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(([]((LTLAPp0==true))&&X((LTLAPp0==true)))))||<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 07:53:05] [INFO ] Flatten gal took : 1029 ms
[2022-05-21 07:53:07] [INFO ] Input system was already deterministic with 494 transitions.
[2022-05-21 07:53:07] [INFO ] Transformed 96 places.
[2022-05-21 07:53:07] [INFO ] Transformed 494 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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
[2022-05-21 07:53:07] [INFO ] Time to serialize gal into /tmp/LTLFireability2082387016208375177.gal : 18 ms
[2022-05-21 07:53:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4700841413296529680.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2082387016208375177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4700841413296529680.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F((G("(((((((((aux12_4>=1)&&(aux10_5>=1))&&(c15>=1))||(((aux12_1>=1)&&(aux10_6>=1))&&(c15>=1)))||((((aux12_1>=1)&&(aux10_4>=1)...8498
Formula 0 simplified : !F(GF(G"(((((((((aux12_4>=1)&&(aux10_5>=1))&&(c15>=1))||(((aux12_1>=1)&&(aux10_6>=1))&&(c15>=1)))||((((aux12_1>=1)&&(aux10_4>=1))&&(...8482

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-20, 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 r150-smll-165276998800428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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