Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 15K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 12 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716869953441

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 04:19:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 04:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:19:16] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-28 04:19:16] [INFO ] Transformed 168 places.
[2024-05-28 04:19:16] [INFO ] Transformed 592 transitions.
[2024-05-28 04:19:16] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 129 transition count 592
Applied a total of 39 rules in 32 ms. Remains 129 /168 variables (removed 39) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 129 cols
[2024-05-28 04:19:16] [INFO ] Computed 19 invariants in 31 ms
[2024-05-28 04:19:16] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-28 04:19:16] [INFO ] Invariant cache hit.
[2024-05-28 04:19:17] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2024-05-28 04:19:17] [INFO ] Invariant cache hit.
[2024-05-28 04:19:17] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1396 ms. Remains : 129/168 places, 592/592 transitions.
Support contains 71 out of 129 places after structural reductions.
[2024-05-28 04:19:18] [INFO ] Flatten gal took : 133 ms
[2024-05-28 04:19:18] [INFO ] Flatten gal took : 77 ms
[2024-05-28 04:19:18] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 70 out of 129 places (down from 71) after GAL structural reductions.
Finished random walk after 468 steps, including 1 resets, run visited all 20 properties in 20 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 129 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 129 transition count 592
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0 U (p1 U (p1&&G(p2)))))))'
Support contains 12 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 78 transition count 230
Applied a total of 85 rules in 29 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-05-28 04:19:18] [INFO ] Computed 17 invariants in 5 ms
[2024-05-28 04:19:19] [INFO ] Implicit Places using invariants in 131 ms returned [0, 19, 33, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 134 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/129 places, 230/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 74/129 places, 230/592 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 s58), p0:(AND (GT 1 s58) (LEQ s41 (ADD s54 s55))), p2:(LEQ (ADD s9 s10 s11 s12 s13 s14 s15 s16) s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-00 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(F(p1))||G(p2)))))'
Support contains 19 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 31 place count 98 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 45 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 84 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 84 transition count 242
Applied a total of 73 rules in 25 ms. Remains 84 /129 variables (removed 45) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2024-05-28 04:19:19] [INFO ] Computed 17 invariants in 4 ms
[2024-05-28 04:19:19] [INFO ] Implicit Places using invariants in 164 ms returned [0, 18, 39, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 184 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/129 places, 242/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 80/129 places, 242/592 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 3 (ADD s10 s11 s12 s13 s14 s15 s16 s17)), p1:(AND (LEQ s9 s75) (LEQ s74 (ADD s18 s19 s20 s21 s23 s24 s25 s26))), p2:(GT s9 s75)], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 495 ms.
Product exploration explored 100000 steps with 33333 reset in 285 ms.
Computed a total of 80 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 242
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 : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-01 finished in 1399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 112 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.6 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 92 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 78 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 78 transition count 230
Applied a total of 69 rules in 37 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-05-28 04:19:21] [INFO ] Computed 17 invariants in 3 ms
[2024-05-28 04:19:21] [INFO ] Implicit Places using invariants in 137 ms returned [0, 19, 33, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 140 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/129 places, 230/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 73 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 73 transition count 228
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 72 transition count 228
Applied a total of 4 rules in 22 ms. Remains 72 /74 variables (removed 2) and now considering 228/230 (removed 2) transitions.
// Phase 1: matrix 228 rows 72 cols
[2024-05-28 04:19:21] [INFO ] Computed 13 invariants in 2 ms
[2024-05-28 04:19:21] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 04:19:21] [INFO ] Invariant cache hit.
[2024-05-28 04:19:21] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/129 places, 228/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 558 ms. Remains : 72/129 places, 228/592 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s9 s10 s11 s12 s13 s14 s15 s16))], 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 807 ms.
Product exploration explored 100000 steps with 355 reset in 780 ms.
Computed a total of 72 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 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 35 ms :[(NOT p0)]
Finished random walk after 294 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 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)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-28 04:19:23] [INFO ] Invariant cache hit.
[2024-05-28 04:19:23] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 12 ms returned sat
[2024-05-28 04:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:19:23] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-28 04:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:19:24] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 9 ms returned sat
[2024-05-28 04:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:19:24] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-28 04:19:24] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 196 transitions) in 41 ms.
[2024-05-28 04:19:24] [INFO ] Added : 25 causal constraints over 8 iterations in 232 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-28 04:19:24] [INFO ] Invariant cache hit.
[2024-05-28 04:19:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 04:19:24] [INFO ] Invariant cache hit.
[2024-05-28 04:19:24] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-28 04:19:24] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 04:19:24] [INFO ] Invariant cache hit.
[2024-05-28 04:19:24] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 72/72 places, 228/228 transitions.
Computed a total of 72 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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 36 ms :[(NOT p0)]
Finished random walk after 275 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=91 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 122 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-28 04:19:25] [INFO ] Invariant cache hit.
[2024-05-28 04:19:25] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 10 ms returned sat
[2024-05-28 04:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:19:25] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-28 04:19:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:19:25] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2024-05-28 04:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:19:25] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-28 04:19:25] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 196 transitions) in 43 ms.
[2024-05-28 04:19:25] [INFO ] Added : 25 causal constraints over 8 iterations in 190 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 355 reset in 633 ms.
Product exploration explored 100000 steps with 355 reset in 663 ms.
Built C files in :
/tmp/ltsmin7316934260374949224
[2024-05-28 04:19:27] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-28 04:19:27] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:19:27] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-28 04:19:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:19:27] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-28 04:19:27] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:19:27] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7316934260374949224
Running compilation step : cd /tmp/ltsmin7316934260374949224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1085 ms.
Running link step : cd /tmp/ltsmin7316934260374949224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7316934260374949224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14369647213529095119.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 228/228 transitions.
Applied a total of 0 rules in 12 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-28 04:19:42] [INFO ] Invariant cache hit.
[2024-05-28 04:19:42] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 04:19:42] [INFO ] Invariant cache hit.
[2024-05-28 04:19:42] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-28 04:19:42] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 04:19:42] [INFO ] Invariant cache hit.
[2024-05-28 04:19:42] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 492 ms. Remains : 72/72 places, 228/228 transitions.
Built C files in :
/tmp/ltsmin11626362633649266887
[2024-05-28 04:19:42] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-28 04:19:42] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:19:42] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-28 04:19:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:19:43] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-28 04:19:43] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:19:43] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11626362633649266887
Running compilation step : cd /tmp/ltsmin11626362633649266887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 784 ms.
Running link step : cd /tmp/ltsmin11626362633649266887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11626362633649266887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13809914277176821308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 04:19:58] [INFO ] Flatten gal took : 22 ms
[2024-05-28 04:19:58] [INFO ] Flatten gal took : 22 ms
[2024-05-28 04:19:58] [INFO ] Time to serialize gal into /tmp/LTL14838944171941360547.gal : 5 ms
[2024-05-28 04:19:58] [INFO ] Time to serialize properties into /tmp/LTL11079237343271011339.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14838944171941360547.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1072195629283131160.hoa' '-atoms' '/tmp/LTL11079237343271011339.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11079237343271011339.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1072195629283131160.hoa
Detected timeout of ITS tools.
[2024-05-28 04:20:13] [INFO ] Flatten gal took : 23 ms
[2024-05-28 04:20:13] [INFO ] Flatten gal took : 21 ms
[2024-05-28 04:20:13] [INFO ] Time to serialize gal into /tmp/LTL2695235478835073215.gal : 5 ms
[2024-05-28 04:20:13] [INFO ] Time to serialize properties into /tmp/LTL5248861404864559964.ltl : 5 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2695235478835073215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5248861404864559964.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))>=2)"))))
Formula 0 simplified : GF!"((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))>=2)"
Detected timeout of ITS tools.
[2024-05-28 04:20:28] [INFO ] Flatten gal took : 19 ms
[2024-05-28 04:20:28] [INFO ] Applying decomposition
[2024-05-28 04:20:28] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17379839756507220963.txt' '-o' '/tmp/graph17379839756507220963.bin' '-w' '/tmp/graph17379839756507220963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17379839756507220963.bin' '-l' '-1' '-v' '-w' '/tmp/graph17379839756507220963.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:20:28] [INFO ] Decomposing Gal with order
[2024-05-28 04:20:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:20:28] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-28 04:20:28] [INFO ] Flatten gal took : 76 ms
[2024-05-28 04:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2024-05-28 04:20:28] [INFO ] Time to serialize gal into /tmp/LTL11452817065047824116.gal : 5 ms
[2024-05-28 04:20:28] [INFO ] Time to serialize properties into /tmp/LTL6887596126029246161.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11452817065047824116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6887596126029246161.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gu1.out8_1+gu1.out8_0)+(gu1.out8_3+gu1.out8_2))+((gu1.out8_6+gu1.out8_7)+(gu1.out8_4+gu1.out8_5)))>=2)"))))
Formula 0 simplified : GF!"((((gu1.out8_1+gu1.out8_0)+(gu1.out8_3+gu1.out8_2))+((gu1.out8_6+gu1.out8_7)+(gu1.out8_4+gu1.out8_5)))>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17842361601279357885
[2024-05-28 04:20:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17842361601279357885
Running compilation step : cd /tmp/ltsmin17842361601279357885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin17842361601279357885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17842361601279357885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-LTLCardinality-02 finished in 97938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 50 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Discarding 79 places :
Also discarding 384 output transitions
Drop transitions removed 384 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 43 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 43 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 41 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 41 transition count 82
Applied a total of 19 rules in 15 ms. Remains 41 /129 variables (removed 88) and now considering 82/592 (removed 510) transitions.
// Phase 1: matrix 82 rows 41 cols
[2024-05-28 04:20:59] [INFO ] Computed 10 invariants in 3 ms
[2024-05-28 04:20:59] [INFO ] Implicit Places using invariants in 79 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/129 places, 82/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 40/129 places, 82/592 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s22 s23) (ADD s18 s19 s20 s21 s27 s28 s29 s30))], 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 497 reset in 496 ms.
Product exploration explored 100000 steps with 497 reset in 508 ms.
Computed a total of 40 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 82
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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 37 ms :[(NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 82 rows 40 cols
[2024-05-28 04:21:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 04:21:00] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-28 04:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:21:00] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 04:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:21:00] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-28 04:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:21:00] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 04:21:00] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 50 transitions) in 10 ms.
[2024-05-28 04:21:00] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 04:21:00] [INFO ] Invariant cache hit.
[2024-05-28 04:21:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 04:21:00] [INFO ] Invariant cache hit.
[2024-05-28 04:21:00] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-28 04:21:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:21:00] [INFO ] Invariant cache hit.
[2024-05-28 04:21:01] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 40/40 places, 82/82 transitions.
Computed a total of 40 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 82
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 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 35 ms :[(NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 117 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-28 04:21:01] [INFO ] Invariant cache hit.
[2024-05-28 04:21:01] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-28 04:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:21:01] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-28 04:21:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:21:01] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-28 04:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:21:01] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 04:21:01] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 50 transitions) in 10 ms.
[2024-05-28 04:21:01] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 497 reset in 485 ms.
Product exploration explored 100000 steps with 497 reset in 505 ms.
Built C files in :
/tmp/ltsmin3467788872378271603
[2024-05-28 04:21:02] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-28 04:21:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:21:02] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-28 04:21:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:21:02] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-28 04:21:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:21:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3467788872378271603
Running compilation step : cd /tmp/ltsmin3467788872378271603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin3467788872378271603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3467788872378271603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5523880081006190000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-28 04:21:17] [INFO ] Invariant cache hit.
[2024-05-28 04:21:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 04:21:17] [INFO ] Invariant cache hit.
[2024-05-28 04:21:18] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-28 04:21:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:21:18] [INFO ] Invariant cache hit.
[2024-05-28 04:21:18] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 40/40 places, 82/82 transitions.
Built C files in :
/tmp/ltsmin8855765839203836252
[2024-05-28 04:21:18] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-28 04:21:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:21:18] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-28 04:21:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:21:18] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-28 04:21:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:21:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8855765839203836252
Running compilation step : cd /tmp/ltsmin8855765839203836252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin8855765839203836252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8855765839203836252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12350236492529420955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 04:21:33] [INFO ] Flatten gal took : 10 ms
[2024-05-28 04:21:33] [INFO ] Flatten gal took : 9 ms
[2024-05-28 04:21:33] [INFO ] Time to serialize gal into /tmp/LTL3203904767029651481.gal : 2 ms
[2024-05-28 04:21:33] [INFO ] Time to serialize properties into /tmp/LTL10344010833815163737.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3203904767029651481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5633391340701045249.hoa' '-atoms' '/tmp/LTL10344010833815163737.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10344010833815163737.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5633391340701045249.hoa
Detected timeout of ITS tools.
[2024-05-28 04:21:48] [INFO ] Flatten gal took : 7 ms
[2024-05-28 04:21:48] [INFO ] Flatten gal took : 7 ms
[2024-05-28 04:21:48] [INFO ] Time to serialize gal into /tmp/LTL6338102381406450271.gal : 6 ms
[2024-05-28 04:21:48] [INFO ] Time to serialize properties into /tmp/LTL2985028393990897836.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6338102381406450271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2985028393990897836.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((in4_6+in4_7)<=(((aux9_4+aux9_5)+(aux9_6+aux9_7))+((aux9_0+aux9_1)+(aux9_2+aux9_3))))"))))
Formula 0 simplified : GF!"((in4_6+in4_7)<=(((aux9_4+aux9_5)+(aux9_6+aux9_7))+((aux9_0+aux9_1)+(aux9_2+aux9_3))))"
Detected timeout of ITS tools.
[2024-05-28 04:22:03] [INFO ] Flatten gal took : 6 ms
[2024-05-28 04:22:03] [INFO ] Applying decomposition
[2024-05-28 04:22:03] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18085856120592597271.txt' '-o' '/tmp/graph18085856120592597271.bin' '-w' '/tmp/graph18085856120592597271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18085856120592597271.bin' '-l' '-1' '-v' '-w' '/tmp/graph18085856120592597271.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:22:03] [INFO ] Decomposing Gal with order
[2024-05-28 04:22:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:22:03] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-28 04:22:03] [INFO ] Flatten gal took : 13 ms
[2024-05-28 04:22:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 4 ms.
[2024-05-28 04:22:03] [INFO ] Time to serialize gal into /tmp/LTL3695392923013956529.gal : 2 ms
[2024-05-28 04:22:03] [INFO ] Time to serialize properties into /tmp/LTL9461681775413074704.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3695392923013956529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9461681775413074704.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((gu2.in4_6+gu2.in4_7)<=(((gu2.aux9_4+gu2.aux9_5)+(gu2.aux9_6+gu2.aux9_7))+((gu2.aux9_0+gu2.aux9_1)+(gu2.aux9_2+gu2.aux9_3))))...160
Formula 0 simplified : GF!"((gu2.in4_6+gu2.in4_7)<=(((gu2.aux9_4+gu2.aux9_5)+(gu2.aux9_6+gu2.aux9_7))+((gu2.aux9_0+gu2.aux9_1)+(gu2.aux9_2+gu2.aux9_3))))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2061805679149394095
[2024-05-28 04:22:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2061805679149394095
Running compilation step : cd /tmp/ltsmin2061805679149394095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin2061805679149394095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2061805679149394095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-LTLCardinality-03 finished in 94650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 17 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 30 place count 99 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 43 place count 99 transition count 468
Applied a total of 43 rules in 8 ms. Remains 99 /129 variables (removed 30) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 99 cols
[2024-05-28 04:22:33] [INFO ] Computed 17 invariants in 5 ms
[2024-05-28 04:22:33] [INFO ] Implicit Places using invariants in 169 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/129 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 98/129 places, 468/592 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s27), p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) (ADD s17 s18 s19 s20 s21 s22 s23 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-04 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F((p1&&X(X(p2)))))))))'
Support contains 19 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 78 transition count 230
Applied a total of 85 rules in 8 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-05-28 04:22:34] [INFO ] Computed 17 invariants in 2 ms
[2024-05-28 04:22:34] [INFO ] Implicit Places using invariants in 106 ms returned [0, 18, 33, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 108 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/129 places, 230/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 74/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 1}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(LEQ (ADD s66 s67) s70), p1:(LEQ 1 s70), p2:(GT (ADD s10 s11 s12 s13 s14 s15 s16 s17) (ADD s32 s33 s34 s35 s36 s37 s42 s43))], 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, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 435 steps with 1 reset in 3 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-05 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 11 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 94 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 88 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 88 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 25 place count 76 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 76 transition count 248
Applied a total of 37 rules in 18 ms. Remains 76 /129 variables (removed 53) and now considering 248/592 (removed 344) transitions.
// Phase 1: matrix 248 rows 76 cols
[2024-05-28 04:22:34] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 04:22:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-28 04:22:34] [INFO ] Invariant cache hit.
[2024-05-28 04:22:34] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-28 04:22:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 04:22:34] [INFO ] Invariant cache hit.
[2024-05-28 04:22:35] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/129 places, 248/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 76/129 places, 248/592 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s19), p1:(GT (ADD s10 s11 s13 s14 s15 s16 s17 s18) (ADD s68 s69))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 355 reset in 785 ms.
Product exploration explored 100000 steps with 355 reset in 828 ms.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
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 : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 274 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-28 04:22:37] [INFO ] Invariant cache hit.
[2024-05-28 04:22:37] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 04:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:22:37] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-28 04:22:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:22:38] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 04:22:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:22:38] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-28 04:22:38] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 36 ms.
[2024-05-28 04:22:38] [INFO ] Added : 22 causal constraints over 5 iterations in 152 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-28 04:22:38] [INFO ] Invariant cache hit.
[2024-05-28 04:22:38] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 04:22:38] [INFO ] Invariant cache hit.
[2024-05-28 04:22:38] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-28 04:22:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 04:22:38] [INFO ] Invariant cache hit.
[2024-05-28 04:22:38] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 520 ms. Remains : 76/76 places, 248/248 transitions.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
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 : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 197 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-28 04:22:39] [INFO ] Invariant cache hit.
[2024-05-28 04:22:39] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 04:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:22:40] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-28 04:22:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:22:40] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 04:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:22:40] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-28 04:22:40] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 29 ms.
[2024-05-28 04:22:40] [INFO ] Added : 22 causal constraints over 5 iterations in 146 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 805 ms.
Product exploration explored 100000 steps with 355 reset in 848 ms.
Built C files in :
/tmp/ltsmin1571796639705024557
[2024-05-28 04:22:42] [INFO ] Computing symmetric may disable matrix : 248 transitions.
[2024-05-28 04:22:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:22:42] [INFO ] Computing symmetric may enable matrix : 248 transitions.
[2024-05-28 04:22:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:22:42] [INFO ] Computing Do-Not-Accords matrix : 248 transitions.
[2024-05-28 04:22:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:22:42] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1571796639705024557
Running compilation step : cd /tmp/ltsmin1571796639705024557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 883 ms.
Running link step : cd /tmp/ltsmin1571796639705024557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1571796639705024557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2182353082237844302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-28 04:22:57] [INFO ] Invariant cache hit.
[2024-05-28 04:22:57] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 04:22:57] [INFO ] Invariant cache hit.
[2024-05-28 04:22:57] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-28 04:22:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 04:22:57] [INFO ] Invariant cache hit.
[2024-05-28 04:22:57] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 76/76 places, 248/248 transitions.
Built C files in :
/tmp/ltsmin11296504657562887129
[2024-05-28 04:22:57] [INFO ] Computing symmetric may disable matrix : 248 transitions.
[2024-05-28 04:22:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:22:57] [INFO ] Computing symmetric may enable matrix : 248 transitions.
[2024-05-28 04:22:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:22:57] [INFO ] Computing Do-Not-Accords matrix : 248 transitions.
[2024-05-28 04:22:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:22:57] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11296504657562887129
Running compilation step : cd /tmp/ltsmin11296504657562887129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 809 ms.
Running link step : cd /tmp/ltsmin11296504657562887129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11296504657562887129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11079791338962686001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 04:23:13] [INFO ] Flatten gal took : 15 ms
[2024-05-28 04:23:13] [INFO ] Flatten gal took : 14 ms
[2024-05-28 04:23:13] [INFO ] Time to serialize gal into /tmp/LTL4792884240733233004.gal : 3 ms
[2024-05-28 04:23:13] [INFO ] Time to serialize properties into /tmp/LTL17076928050522158754.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4792884240733233004.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3245230300135774178.hoa' '-atoms' '/tmp/LTL17076928050522158754.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17076928050522158754.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3245230300135774178.hoa
Detected timeout of ITS tools.
[2024-05-28 04:23:28] [INFO ] Flatten gal took : 14 ms
[2024-05-28 04:23:28] [INFO ] Flatten gal took : 14 ms
[2024-05-28 04:23:28] [INFO ] Time to serialize gal into /tmp/LTL5510561189007339625.gal : 2 ms
[2024-05-28 04:23:28] [INFO ] Time to serialize properties into /tmp/LTL3979472243397223592.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5510561189007339625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3979472243397223592.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(c17<2)"))&&(F(G("((((out3_0+out3_1)+(out3_6+out3_7))+((out3_2+out3_3)+(out3_4+out3_5)))>(in3_5+in3_4))"))))))
Formula 0 simplified : F(G!"(c17<2)" | GF!"((((out3_0+out3_1)+(out3_6+out3_7))+((out3_2+out3_3)+(out3_4+out3_5)))>(in3_5+in3_4))")
Detected timeout of ITS tools.
[2024-05-28 04:23:43] [INFO ] Flatten gal took : 13 ms
[2024-05-28 04:23:43] [INFO ] Applying decomposition
[2024-05-28 04:23:43] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6210693284612946769.txt' '-o' '/tmp/graph6210693284612946769.bin' '-w' '/tmp/graph6210693284612946769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6210693284612946769.bin' '-l' '-1' '-v' '-w' '/tmp/graph6210693284612946769.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:23:43] [INFO ] Decomposing Gal with order
[2024-05-28 04:23:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:23:43] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-28 04:23:43] [INFO ] Flatten gal took : 29 ms
[2024-05-28 04:23:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2024-05-28 04:23:43] [INFO ] Time to serialize gal into /tmp/LTL13777413633463113069.gal : 9 ms
[2024-05-28 04:23:43] [INFO ] Time to serialize properties into /tmp/LTL880623336112790524.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13777413633463113069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL880623336112790524.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(gi0.gu2.c17<2)"))&&(F(G("((((gu3.out3_0+gu3.out3_1)+(gu3.out3_6+gu3.out3_7))+((gu3.out3_2+gu3.out3_3)+(gu3.out3_4+gu3.out3_5...188
Formula 0 simplified : F(G!"(gi0.gu2.c17<2)" | GF!"((((gu3.out3_0+gu3.out3_1)+(gu3.out3_6+gu3.out3_7))+((gu3.out3_2+gu3.out3_3)+(gu3.out3_4+gu3.out3_5)))>(...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9155986792140703716
[2024-05-28 04:23:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9155986792140703716
Running compilation step : cd /tmp/ltsmin9155986792140703716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 643 ms.
Running link step : cd /tmp/ltsmin9155986792140703716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9155986792140703716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-06 finished in 99026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 51 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 77 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 100 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 123 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 52 transition count 90
Applied a total of 129 rules in 7 ms. Remains 52 /129 variables (removed 77) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 52 cols
[2024-05-28 04:24:13] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 04:24:13] [INFO ] Implicit Places using invariants in 90 ms returned [0, 5, 18, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 92 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/129 places, 90/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 48/129 places, 90/592 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT 2 s19), p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Product exploration explored 100000 steps with 33333 reset in 201 ms.
Computed a total of 48 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 90
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 : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-09 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 80 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 58 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 56 transition count 108
Applied a total of 122 rules in 17 ms. Remains 56 /129 variables (removed 73) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2024-05-28 04:24:14] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 04:24:14] [INFO ] Implicit Places using invariants in 146 ms returned [0, 7, 21, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 148 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/129 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 52/129 places, 108/592 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s26 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 52 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 108
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-10 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 56 transition count 102
Applied a total of 122 rules in 13 ms. Remains 56 /129 variables (removed 73) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 56 cols
[2024-05-28 04:24:15] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 04:24:15] [INFO ] Implicit Places using invariants in 113 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/129 places, 102/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 55/129 places, 102/592 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s10 s9)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 5252 steps with 43 reset in 48 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-11 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 51 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 77 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 52 transition count 92
Applied a total of 129 rules in 20 ms. Remains 52 /129 variables (removed 77) and now considering 92/592 (removed 500) transitions.
// Phase 1: matrix 92 rows 52 cols
[2024-05-28 04:24:15] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 04:24:15] [INFO ] Implicit Places using invariants in 108 ms returned [0, 5, 19, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/129 places, 92/592 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 LTL mode , in 2 iterations and 130 ms. Remains : 48/129 places, 92/592 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-14 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2024-05-28 04:24:16] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15032057381954380390
[2024-05-28 04:24:16] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2024-05-28 04:24:16] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:16] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2024-05-28 04:24:16] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:16] [INFO ] Applying decomposition
[2024-05-28 04:24:16] [INFO ] Flatten gal took : 50 ms
[2024-05-28 04:24:16] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2024-05-28 04:24:16] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:16] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15032057381954380390
Running compilation step : cd /tmp/ltsmin15032057381954380390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.202304061127/bin/convert-linux64' '-i' '/tmp/graph17778436083097259743.txt' '-o' '/tmp/graph17778436083097259743.bin' '-w' '/tmp/graph17778436083097259743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17778436083097259743.bin' '-l' '-1' '-v' '-w' '/tmp/graph17778436083097259743.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:24:16] [INFO ] Decomposing Gal with order
[2024-05-28 04:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:24:16] [INFO ] Removed a total of 395 redundant transitions.
[2024-05-28 04:24:16] [INFO ] Flatten gal took : 226 ms
[2024-05-28 04:24:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 440 labels/synchronizations in 34 ms.
[2024-05-28 04:24:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality11172877539761322399.gal : 8 ms
[2024-05-28 04:24:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality6758295124146027113.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11172877539761322399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6758295124146027113.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(G("((((gu0.out8_1+gu0.out8_0)+(gu0.out8_3+gu0.out8_2))+((gu0.out8_6+gu0.out8_7)+(gu0.out8_4+gu0.out8_5)))>=2)"))))
Formula 0 simplified : GF!"((((gu0.out8_1+gu0.out8_0)+(gu0.out8_3+gu0.out8_2))+((gu0.out8_6+gu0.out8_7)+(gu0.out8_4+gu0.out8_5)))>=2)"
Compilation finished in 2740 ms.
Running link step : cd /tmp/ltsmin15032057381954380390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15032057381954380390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15032057381954380390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15032057381954380390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 04:45:57] [INFO ] Flatten gal took : 56 ms
[2024-05-28 04:45:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality7294518077415262607.gal : 22 ms
[2024-05-28 04:45:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality605273414539758066.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7294518077415262607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality605273414539758066.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 3 LTL properties
Checking formula 0 : !((F(G("((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))>=2)"))))
Formula 0 simplified : GF!"((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))>=2)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15032057381954380390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15032057381954380390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 05:07:39] [INFO ] Flatten gal took : 67 ms
[2024-05-28 05:07:39] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-28 05:07:39] [INFO ] Transformed 129 places.
[2024-05-28 05:07:39] [INFO ] Transformed 592 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../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
[2024-05-28 05:07:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality5108806000237266459.gal : 5 ms
[2024-05-28 05:07:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality12207112881125029496.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5108806000237266459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12207112881125029496.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))>=2)"))))
Formula 0 simplified : GF!"((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))>=2)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9921728 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036836 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PermAdmissibility-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422000117"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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