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-171654422000122.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-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 12 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:05 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 5.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 12 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 340K 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-50-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716873977820

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-50
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 05:26:20] [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 05:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:26:20] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-28 05:26:20] [INFO ] Transformed 168 places.
[2024-05-28 05:26:20] [INFO ] Transformed 592 transitions.
[2024-05-28 05:26:20] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-50-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-50-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 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 143 transition count 592
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 139 transition count 528
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 139 transition count 528
Applied a total of 33 rules in 45 ms. Remains 139 /168 variables (removed 29) and now considering 528/592 (removed 64) transitions.
// Phase 1: matrix 528 rows 139 cols
[2024-05-28 05:26:21] [INFO ] Computed 20 invariants in 51 ms
[2024-05-28 05:26:21] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-28 05:26:21] [INFO ] Invariant cache hit.
[2024-05-28 05:26:22] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-28 05:26:22] [INFO ] Invariant cache hit.
[2024-05-28 05:26:22] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/168 places, 528/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 139/168 places, 528/592 transitions.
Support contains 101 out of 139 places after structural reductions.
[2024-05-28 05:26:23] [INFO ] Flatten gal took : 162 ms
[2024-05-28 05:26:23] [INFO ] Flatten gal took : 95 ms
[2024-05-28 05:26:23] [INFO ] Input system was already deterministic with 528 transitions.
Incomplete random walk after 10008 steps, including 12 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 34) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 05:26:23] [INFO ] Invariant cache hit.
[2024-05-28 05:26:23] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 05:26:23] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 11 ms returned sat
[2024-05-28 05:26:24] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 05:26:25] [INFO ] After 1294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6323 ms.
[2024-05-28 05:26:31] [INFO ] After 7713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 797 steps, including 0 resets, run visited all 2 properties in 44 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 46 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 139 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 139 transition count 528
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((X(F(p0))||(G(p1)&&X(G(p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 100 transition count 528
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 61 place count 78 transition count 344
Iterating global reduction 1 with 22 rules applied. Total rules applied 83 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 107 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 131 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 134 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 51 transition count 84
Applied a total of 137 rules in 23 ms. Remains 51 /139 variables (removed 88) and now considering 84/528 (removed 444) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-28 05:26:32] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 05:26:32] [INFO ] Implicit Places using invariants in 98 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/139 places, 84/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 47/139 places, 84/528 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 404 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 s5), p0:(LEQ s37 s44), p2:(GT (ADD s39 s40) s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 487 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
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 p0 p2), (X p1), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-50-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLCardinality-00 finished in 1513 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||(X(G(p1)) U (p0&&X(G(p1))))))))'
Support contains 8 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 94 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.7 ms
Discarding 45 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 87 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 87 transition count 352
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 80 transition count 240
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 80 transition count 240
Applied a total of 29 rules in 44 ms. Remains 80 /139 variables (removed 59) and now considering 240/528 (removed 288) transitions.
// Phase 1: matrix 240 rows 80 cols
[2024-05-28 05:26:33] [INFO ] Computed 15 invariants in 7 ms
[2024-05-28 05:26:33] [INFO ] Implicit Places using invariants in 200 ms returned [0, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 202 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/139 places, 240/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 78 /78 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 78/139 places, 240/528 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s27 s28 s29 s30 s31 s32 s33 s42))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4607 reset in 538 ms.
Product exploration explored 100000 steps with 4586 reset in 641 ms.
Computed a total of 78 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 240
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 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 358 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=179 )
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 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 240 rows 78 cols
[2024-05-28 05:26:35] [INFO ] Computed 13 invariants in 3 ms
[2024-05-28 05:26:35] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 9 ms returned sat
[2024-05-28 05:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:26:35] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-28 05:26:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:26:35] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 13 ms returned sat
[2024-05-28 05:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:26:36] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-28 05:26:36] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 208 transitions) in 48 ms.
[2024-05-28 05:26:36] [INFO ] Added : 15 causal constraints over 4 iterations in 204 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 78 /78 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-28 05:26:36] [INFO ] Invariant cache hit.
[2024-05-28 05:26:36] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 05:26:36] [INFO ] Invariant cache hit.
[2024-05-28 05:26:36] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-28 05:26:36] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 05:26:36] [INFO ] Invariant cache hit.
[2024-05-28 05:26:36] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 78/78 places, 240/240 transitions.
Computed a total of 78 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 240
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 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 358 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=358 )
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 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-28 05:26:37] [INFO ] Invariant cache hit.
[2024-05-28 05:26:37] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 14 ms returned sat
[2024-05-28 05:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:26:37] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-28 05:26:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:26:37] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-28 05:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:26:37] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-28 05:26:38] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 208 transitions) in 35 ms.
[2024-05-28 05:26:38] [INFO ] Added : 15 causal constraints over 4 iterations in 152 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4612 reset in 502 ms.
Product exploration explored 100000 steps with 4624 reset in 517 ms.
Built C files in :
/tmp/ltsmin10128127401173904522
[2024-05-28 05:26:39] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-28 05:26:39] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:26:39] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-28 05:26:39] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:26:39] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-28 05:26:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:26:39] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10128127401173904522
Running compilation step : cd /tmp/ltsmin10128127401173904522;'/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 1006 ms.
Running link step : cd /tmp/ltsmin10128127401173904522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10128127401173904522;'/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/stateBased725791473502100966.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 240/240 transitions.
Graph (complete) has 477 edges and 78 vertex of which 60 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 46 transition count 98
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 46 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 34 place count 41 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 41 transition count 70
Applied a total of 39 rules in 11 ms. Remains 41 /78 variables (removed 37) and now considering 70/240 (removed 170) transitions.
// Phase 1: matrix 70 rows 41 cols
[2024-05-28 05:26:54] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 05:26:54] [INFO ] Implicit Places using invariants in 62 ms returned [17, 22, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/78 places, 70/240 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 38 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 37 transition count 69
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 37 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 36 transition count 68
Applied a total of 4 rules in 10 ms. Remains 36 /38 variables (removed 2) and now considering 68/70 (removed 2) transitions.
// Phase 1: matrix 68 rows 36 cols
[2024-05-28 05:26:54] [INFO ] Computed 8 invariants in 1 ms
[2024-05-28 05:26:54] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 05:26:54] [INFO ] Invariant cache hit.
[2024-05-28 05:26:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/78 places, 68/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 36/78 places, 68/240 transitions.
Built C files in :
/tmp/ltsmin8546524646267577933
[2024-05-28 05:26:54] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2024-05-28 05:26:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:26:54] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2024-05-28 05:26:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:26:54] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2024-05-28 05:26:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:26:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8546524646267577933
Running compilation step : cd /tmp/ltsmin8546524646267577933;'/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 250 ms.
Running link step : cd /tmp/ltsmin8546524646267577933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8546524646267577933;'/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/stateBased1000672163479928752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 05:27:09] [INFO ] Flatten gal took : 9 ms
[2024-05-28 05:27:09] [INFO ] Flatten gal took : 7 ms
[2024-05-28 05:27:09] [INFO ] Time to serialize gal into /tmp/LTL11164237830293436046.gal : 2 ms
[2024-05-28 05:27:09] [INFO ] Time to serialize properties into /tmp/LTL1959744399627817002.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/LTL11164237830293436046.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5271214627277490303.hoa' '-atoms' '/tmp/LTL1959744399627817002.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/LTL1959744399627817002.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5271214627277490303.hoa
Detected timeout of ITS tools.
[2024-05-28 05:27:24] [INFO ] Flatten gal took : 25 ms
[2024-05-28 05:27:24] [INFO ] Flatten gal took : 30 ms
[2024-05-28 05:27:24] [INFO ] Time to serialize gal into /tmp/LTL1859748136434679433.gal : 4 ms
[2024-05-28 05:27:24] [INFO ] Time to serialize properties into /tmp/LTL18262431984477831773.ltl : 7 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/LTL1859748136434679433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18262431984477831773.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 : !((G(F(("((((aux12_6+aux12_5)+(aux12_4+aux12_3))+((aux12_2+aux12_1)+(aux12_0+aux12_7)))>=1)")||((X(G("(((((aux9_4+aux9_5)+(aux9_6+aux9...539
Formula 0 simplified : FG(!"((((aux12_6+aux12_5)+(aux12_4+aux12_3))+((aux12_2+aux12_1)+(aux12_0+aux12_7)))>=1)" & (!"((((aux12_6+aux12_5)+(aux12_4+aux12_3)...363
Detected timeout of ITS tools.
[2024-05-28 05:27:40] [INFO ] Flatten gal took : 26 ms
[2024-05-28 05:27:40] [INFO ] Applying decomposition
[2024-05-28 05:27:40] [INFO ] Flatten gal took : 21 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/graph8933694659835917084.txt' '-o' '/tmp/graph8933694659835917084.bin' '-w' '/tmp/graph8933694659835917084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8933694659835917084.bin' '-l' '-1' '-v' '-w' '/tmp/graph8933694659835917084.weights' '-q' '0' '-e' '0.001'
[2024-05-28 05:27:40] [INFO ] Decomposing Gal with order
[2024-05-28 05:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 05:27:40] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-28 05:27:40] [INFO ] Flatten gal took : 128 ms
[2024-05-28 05:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 18 ms.
[2024-05-28 05:27:40] [INFO ] Time to serialize gal into /tmp/LTL3278026820032683206.gal : 7 ms
[2024-05-28 05:27:40] [INFO ] Time to serialize properties into /tmp/LTL10711979412978917818.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/LTL3278026820032683206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10711979412978917818.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 : !((G(F(("((((gu2.aux12_6+gu2.aux12_5)+(gu2.aux12_4+gu2.aux12_3))+((gu2.aux12_2+gu2.aux12_1)+(gu2.aux12_0+gu2.aux12_7)))>=1)")||((X(G("...755
Formula 0 simplified : FG(!"((((gu2.aux12_6+gu2.aux12_5)+(gu2.aux12_4+gu2.aux12_3))+((gu2.aux12_2+gu2.aux12_1)+(gu2.aux12_0+gu2.aux12_7)))>=1)" & (!"((((gu...503
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16536552259574917649
[2024-05-28 05:27:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16536552259574917649
Running compilation step : cd /tmp/ltsmin16536552259574917649;'/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 637 ms.
Running link step : cd /tmp/ltsmin16536552259574917649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16536552259574917649;'/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)||(X([]((LTLAPp1==true))) U ((LTLAPp0==true)&&X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-01 finished in 97257 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))&&F((p2 U (p3||G(p2)))))))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 116 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.4 ms
Discarding 23 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 107 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 107 transition count 384
Applied a total of 19 rules in 34 ms. Remains 107 /139 variables (removed 32) and now considering 384/528 (removed 144) transitions.
// Phase 1: matrix 384 rows 107 cols
[2024-05-28 05:28:10] [INFO ] Computed 18 invariants in 4 ms
[2024-05-28 05:28:10] [INFO ] Implicit Places using invariants in 199 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 201 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/139 places, 384/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 106/139 places, 384/528 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-02 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=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ 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}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s103 (ADD s29 s31 s32 s33 s34 s35 s36 s37)), p1:(GT s40 (ADD s9 s10 s11 s12 s13 s14 s15 s16)), p3:(AND (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s8)) (GT s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 800 steps with 0 reset in 10 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-02 finished in 608 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 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 108 transition count 528
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 93 transition count 372
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 83 transition count 262
Applied a total of 81 rules in 11 ms. Remains 83 /139 variables (removed 56) and now considering 262/528 (removed 266) transitions.
// Phase 1: matrix 262 rows 83 cols
[2024-05-28 05:28:11] [INFO ] Computed 17 invariants in 3 ms
[2024-05-28 05:28:11] [INFO ] Implicit Places using invariants in 119 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/139 places, 262/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 82/139 places, 262/528 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-03 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 3 (ADD s15 s17 s18 s19 s20 s21 s22 s23))], 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]]
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Product exploration explored 100000 steps with 33333 reset in 187 ms.
Computed a total of 82 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 262
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 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-50-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLCardinality-03 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' '!(F(G(p0)))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 32 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.1 ms
Discarding 107 places :
Also discarding 448 output transitions
Drop transitions removed 448 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 25 transition count 38
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 25 transition count 38
Applied a total of 15 rules in 7 ms. Remains 25 /139 variables (removed 114) and now considering 38/528 (removed 490) transitions.
// Phase 1: matrix 38 rows 25 cols
[2024-05-28 05:28:12] [INFO ] Computed 8 invariants in 1 ms
[2024-05-28 05:28:12] [INFO ] Implicit Places using invariants in 42 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/139 places, 38/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54 ms. Remains : 24/139 places, 38/528 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-04 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 s13 s14) s2)], 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 249 reset in 369 ms.
Product exploration explored 100000 steps with 249 reset in 390 ms.
Computed a total of 24 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 38
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 92 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 204 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=204 )
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 118 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)]
// Phase 1: matrix 38 rows 24 cols
[2024-05-28 05:28:13] [INFO ] Computed 7 invariants in 1 ms
[2024-05-28 05:28:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 05:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:28:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 05:28:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:28:13] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 05:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:28:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 05:28:13] [INFO ] Computed and/alt/rep : 25/136/25 causal constraints (skipped 9 transitions) in 5 ms.
[2024-05-28 05:28:13] [INFO ] Added : 20 causal constraints over 5 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-28 05:28:13] [INFO ] Invariant cache hit.
[2024-05-28 05:28:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 05:28:13] [INFO ] Invariant cache hit.
[2024-05-28 05:28:13] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-28 05:28:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 05:28:13] [INFO ] Invariant cache hit.
[2024-05-28 05:28:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 24/24 places, 38/38 transitions.
Computed a total of 24 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 38
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 94 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 204 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
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 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-28 05:28:14] [INFO ] Invariant cache hit.
[2024-05-28 05:28:14] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 05:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:28:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 05:28:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:28:14] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 05:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:28:14] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 05:28:14] [INFO ] Computed and/alt/rep : 25/136/25 causal constraints (skipped 9 transitions) in 8 ms.
[2024-05-28 05:28:14] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 249 reset in 308 ms.
Product exploration explored 100000 steps with 249 reset in 321 ms.
Built C files in :
/tmp/ltsmin3211937546508317944
[2024-05-28 05:28:14] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2024-05-28 05:28:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:28:14] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2024-05-28 05:28:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:28:14] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2024-05-28 05:28:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:28:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3211937546508317944
Running compilation step : cd /tmp/ltsmin3211937546508317944;'/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 175 ms.
Running link step : cd /tmp/ltsmin3211937546508317944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3211937546508317944;'/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/stateBased5561553058724180987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-28 05:28:29] [INFO ] Invariant cache hit.
[2024-05-28 05:28:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 05:28:30] [INFO ] Invariant cache hit.
[2024-05-28 05:28:30] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-28 05:28:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 05:28:30] [INFO ] Invariant cache hit.
[2024-05-28 05:28:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 24/24 places, 38/38 transitions.
Built C files in :
/tmp/ltsmin5197383640062464223
[2024-05-28 05:28:30] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2024-05-28 05:28:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:28:30] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2024-05-28 05:28:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:28:30] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2024-05-28 05:28:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:28:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5197383640062464223
Running compilation step : cd /tmp/ltsmin5197383640062464223;'/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 164 ms.
Running link step : cd /tmp/ltsmin5197383640062464223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5197383640062464223;'/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/stateBased1270870491267475720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 05:28:45] [INFO ] Flatten gal took : 4 ms
[2024-05-28 05:28:45] [INFO ] Flatten gal took : 4 ms
[2024-05-28 05:28:45] [INFO ] Time to serialize gal into /tmp/LTL2364754752040737268.gal : 2 ms
[2024-05-28 05:28:45] [INFO ] Time to serialize properties into /tmp/LTL16561241244444626188.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/LTL2364754752040737268.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11581223804691369309.hoa' '-atoms' '/tmp/LTL16561241244444626188.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/LTL16561241244444626188.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11581223804691369309.hoa
Detected timeout of ITS tools.
[2024-05-28 05:29:00] [INFO ] Flatten gal took : 3 ms
[2024-05-28 05:29:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 05:29:00] [INFO ] Time to serialize gal into /tmp/LTL5896805627570092105.gal : 1 ms
[2024-05-28 05:29:00] [INFO ] Time to serialize properties into /tmp/LTL16037806233366976823.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/LTL5896805627570092105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16037806233366976823.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("((in2_2+in2_3)<=c12)"))))
Formula 0 simplified : GF!"((in2_2+in2_3)<=c12)"
Detected timeout of ITS tools.
[2024-05-28 05:29:15] [INFO ] Flatten gal took : 3 ms
[2024-05-28 05:29:15] [INFO ] Applying decomposition
[2024-05-28 05:29:15] [INFO ] Flatten gal took : 3 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/graph16883863004920122336.txt' '-o' '/tmp/graph16883863004920122336.bin' '-w' '/tmp/graph16883863004920122336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16883863004920122336.bin' '-l' '-1' '-v' '-w' '/tmp/graph16883863004920122336.weights' '-q' '0' '-e' '0.001'
[2024-05-28 05:29:15] [INFO ] Decomposing Gal with order
[2024-05-28 05:29:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 05:29:15] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-28 05:29:15] [INFO ] Flatten gal took : 8 ms
[2024-05-28 05:29:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2024-05-28 05:29:15] [INFO ] Time to serialize gal into /tmp/LTL648098181174137255.gal : 1 ms
[2024-05-28 05:29:15] [INFO ] Time to serialize properties into /tmp/LTL12511837579011004238.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/LTL648098181174137255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12511837579011004238.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("((gu1.in2_2+gu1.in2_3)<=gu1.c12)"))))
Formula 0 simplified : GF!"((gu1.in2_2+gu1.in2_3)<=gu1.c12)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14653480435367989188
[2024-05-28 05:29:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14653480435367989188
Running compilation step : cd /tmp/ltsmin14653480435367989188;'/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 155 ms.
Running link step : cd /tmp/ltsmin14653480435367989188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14653480435367989188;'/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-50-LTLCardinality-04 finished in 93570 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(X(F((F(!(p0 U p1))&&!(p2 U p3)&&!p0)))))'
Support contains 21 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 94 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.3 ms
Discarding 45 places :
Also discarding 64 output transitions
Drop transitions removed 64 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 19 ms. Remains 76 /139 variables (removed 63) and now considering 248/528 (removed 280) transitions.
// Phase 1: matrix 248 rows 76 cols
[2024-05-28 05:29:45] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 05:29:45] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-28 05:29:45] [INFO ] Invariant cache hit.
[2024-05-28 05:29:46] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-28 05:29:46] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 05:29:46] [INFO ] Invariant cache hit.
[2024-05-28 05:29:46] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/139 places, 248/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 593 ms. Remains : 76/139 places, 248/528 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(OR p0 p3), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=p3, acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s10 s11 s13 s14 s15 s16 s17 s18) (ADD s20 s25 s27 s28)), p0:(LEQ s64 s22), p3:(LEQ (ADD s49 s50 s51 s52) (ADD s74 s75)), p2:(LEQ 2 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 303 reset in 1008 ms.
Product exploration explored 100000 steps with 287 reset in 1049 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 p1 p0 p3 (NOT p2)), (X (OR p0 p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p1), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 2643 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Incomplete random walk after 10023 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 6) seen :4
Finished Best-First random walk after 2977 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=175 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (OR p0 p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p1), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p0) (NOT p3) p2)), (F (AND (NOT p3) p2)), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 15 factoid took 4485 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Stuttering acceptance computed with spot in 171 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
[2024-05-28 05:29:56] [INFO ] Invariant cache hit.
[2024-05-28 05:29:56] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 05:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:29:56] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-28 05:29:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:29:56] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 05:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:29:56] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 05:29:56] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 37 ms.
[2024-05-28 05:29:57] [INFO ] Added : 25 causal constraints over 7 iterations in 184 ms. Result :sat
Could not prove EG p1
[2024-05-28 05:29:57] [INFO ] Invariant cache hit.
[2024-05-28 05:29:57] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 14 ms returned sat
[2024-05-28 05:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:29:57] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-28 05:29:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:29:57] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 16 ms returned sat
[2024-05-28 05:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:29:57] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-28 05:29:57] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 23 ms.
[2024-05-28 05:29:57] [INFO ] Added : 16 causal constraints over 4 iterations in 120 ms. Result :sat
Could not prove EG p0
[2024-05-28 05:29:57] [INFO ] Invariant cache hit.
[2024-05-28 05:29:57] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 17 ms returned sat
[2024-05-28 05:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:29:57] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-28 05:29:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:29:58] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 05:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:29:58] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-28 05:29:58] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 23 ms.
[2024-05-28 05:29:58] [INFO ] Added : 15 causal constraints over 5 iterations in 130 ms. Result :sat
Could not prove EG p3
Support contains 21 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 05:29:58] [INFO ] Invariant cache hit.
[2024-05-28 05:29:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 05:29:58] [INFO ] Invariant cache hit.
[2024-05-28 05:29:58] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-28 05:29:58] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 05:29:58] [INFO ] Invariant cache hit.
[2024-05-28 05:29:58] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 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 p1 p0 p3 (NOT p2)), (X (OR p0 p3)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 2887 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Incomplete random walk after 10013 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 6) seen :5
Finished Best-First random walk after 5285 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=480 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (OR p0 p3)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p3)), (X (X (OR p0 p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p0) (NOT p3) p2)), (F (AND (NOT p3) p2)), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 15 factoid took 4434 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Stuttering acceptance computed with spot in 186 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
[2024-05-28 05:30:06] [INFO ] Invariant cache hit.
[2024-05-28 05:30:06] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 05:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:07] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-28 05:30:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:30:07] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2024-05-28 05:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:07] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 05:30:07] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 23 ms.
[2024-05-28 05:30:07] [INFO ] Added : 25 causal constraints over 7 iterations in 173 ms. Result :sat
Could not prove EG p1
[2024-05-28 05:30:07] [INFO ] Invariant cache hit.
[2024-05-28 05:30:07] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 14 ms returned sat
[2024-05-28 05:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:07] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-28 05:30:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:30:07] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 19 ms returned sat
[2024-05-28 05:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:07] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-28 05:30:08] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 21 ms.
[2024-05-28 05:30:08] [INFO ] Added : 16 causal constraints over 4 iterations in 115 ms. Result :sat
Could not prove EG p0
[2024-05-28 05:30:08] [INFO ] Invariant cache hit.
[2024-05-28 05:30:08] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 18 ms returned sat
[2024-05-28 05:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:08] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-28 05:30:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:30:08] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 05:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:08] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-28 05:30:08] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 24 ms.
[2024-05-28 05:30:08] [INFO ] Added : 15 causal constraints over 5 iterations in 133 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 177 ms :[(OR p1 p0 p3), p1, (OR p0 p3), p3]
Product exploration explored 100000 steps with 301 reset in 1067 ms.
Product exploration explored 100000 steps with 302 reset in 1121 ms.
Built C files in :
/tmp/ltsmin264406405073872716
[2024-05-28 05:30:11] [INFO ] Computing symmetric may disable matrix : 248 transitions.
[2024-05-28 05:30:11] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:11] [INFO ] Computing symmetric may enable matrix : 248 transitions.
[2024-05-28 05:30:11] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:11] [INFO ] Computing Do-Not-Accords matrix : 248 transitions.
[2024-05-28 05:30:11] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:11] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin264406405073872716
Running compilation step : cd /tmp/ltsmin264406405073872716;'/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 860 ms.
Running link step : cd /tmp/ltsmin264406405073872716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin264406405073872716;'/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/stateBased14663564329683435123.hoa' '--buchi-type=spotba'
LTSmin run took 2001 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-50-LTLCardinality-06 finished in 28469 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||G(F(p1))))&&F(!p0))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 102 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 82 transition count 348
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 82 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 63 place count 60 transition count 126
Iterating global reduction 0 with 22 rules applied. Total rules applied 85 place count 60 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 58 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 58 transition count 110
Applied a total of 89 rules in 16 ms. Remains 58 /139 variables (removed 81) and now considering 110/528 (removed 418) transitions.
// Phase 1: matrix 110 rows 58 cols
[2024-05-28 05:30:14] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 05:30:14] [INFO ] Implicit Places using invariants in 84 ms returned [0, 7, 22, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/139 places, 110/528 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 54 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 109
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 53 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 52 transition count 108
Applied a total of 4 rules in 6 ms. Remains 52 /54 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 52 cols
[2024-05-28 05:30:14] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 05:30:14] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 05:30:14] [INFO ] Invariant cache hit.
[2024-05-28 05:30:14] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/139 places, 108/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 52/139 places, 108/528 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s13 s10), p1:(GT s5 s45)], 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 5291 reset in 403 ms.
Product exploration explored 100000 steps with 5275 reset in 437 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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Finished random walk after 307 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=153 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 406 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
[2024-05-28 05:30:16] [INFO ] Invariant cache hit.
[2024-05-28 05:30:16] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-28 05:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:16] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-28 05:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:30:16] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-28 05:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:16] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 05:30:16] [INFO ] Computed and/alt/rep : 20/112/20 causal constraints (skipped 84 transitions) in 9 ms.
[2024-05-28 05:30:16] [INFO ] Added : 16 causal constraints over 5 iterations in 71 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 05:30:16] [INFO ] Invariant cache hit.
[2024-05-28 05:30:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 05:30:16] [INFO ] Invariant cache hit.
[2024-05-28 05:30:16] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-28 05:30:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 05:30:16] [INFO ] Invariant cache hit.
[2024-05-28 05:30:16] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 52/52 places, 108/108 transitions.
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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Finished random walk after 307 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=307 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
[2024-05-28 05:30:17] [INFO ] Invariant cache hit.
[2024-05-28 05:30:17] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 8 ms returned sat
[2024-05-28 05:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:18] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-28 05:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:30:18] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 9 ms returned sat
[2024-05-28 05:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:30:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-28 05:30:18] [INFO ] Computed and/alt/rep : 20/112/20 causal constraints (skipped 84 transitions) in 9 ms.
[2024-05-28 05:30:18] [INFO ] Added : 16 causal constraints over 5 iterations in 72 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5284 reset in 401 ms.
Product exploration explored 100000 steps with 5282 reset in 431 ms.
Built C files in :
/tmp/ltsmin15310167960454800278
[2024-05-28 05:30:19] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-28 05:30:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:19] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-28 05:30:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:19] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-28 05:30:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15310167960454800278
Running compilation step : cd /tmp/ltsmin15310167960454800278;'/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 352 ms.
Running link step : cd /tmp/ltsmin15310167960454800278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15310167960454800278;'/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/stateBased15428814109973907110.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 05:30:34] [INFO ] Invariant cache hit.
[2024-05-28 05:30:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 05:30:34] [INFO ] Invariant cache hit.
[2024-05-28 05:30:34] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 05:30:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 05:30:34] [INFO ] Invariant cache hit.
[2024-05-28 05:30:34] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 52/52 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin16126219390141647879
[2024-05-28 05:30:34] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-28 05:30:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:34] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-28 05:30:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:34] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-28 05:30:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:30:34] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16126219390141647879
Running compilation step : cd /tmp/ltsmin16126219390141647879;'/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 362 ms.
Running link step : cd /tmp/ltsmin16126219390141647879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16126219390141647879;'/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/stateBased17350240728123628104.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 05:30:49] [INFO ] Flatten gal took : 8 ms
[2024-05-28 05:30:49] [INFO ] Flatten gal took : 8 ms
[2024-05-28 05:30:49] [INFO ] Time to serialize gal into /tmp/LTL2416484965645535748.gal : 3 ms
[2024-05-28 05:30:49] [INFO ] Time to serialize properties into /tmp/LTL5984526221347429780.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/LTL2416484965645535748.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7552065207373731385.hoa' '-atoms' '/tmp/LTL5984526221347429780.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...317
Loading property file /tmp/LTL5984526221347429780.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7552065207373731385.hoa
Detected timeout of ITS tools.
[2024-05-28 05:31:04] [INFO ] Flatten gal took : 7 ms
[2024-05-28 05:31:04] [INFO ] Flatten gal took : 7 ms
[2024-05-28 05:31:04] [INFO ] Time to serialize gal into /tmp/LTL2400710794900421384.gal : 3 ms
[2024-05-28 05:31:04] [INFO ] Time to serialize properties into /tmp/LTL7548243433888520120.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/LTL2400710794900421384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7548243433888520120.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(("(c12>out4_5)")||(G(F("(out6_5>in3_4)")))))&&(F("(c12<=out4_5)")))))
Formula 0 simplified : F(G(!"(c12>out4_5)" & FG!"(out6_5>in3_4)") | G!"(c12<=out4_5)")
Detected timeout of ITS tools.
[2024-05-28 05:31:19] [INFO ] Flatten gal took : 7 ms
[2024-05-28 05:31:19] [INFO ] Applying decomposition
[2024-05-28 05:31:19] [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/graph15847132580900057200.txt' '-o' '/tmp/graph15847132580900057200.bin' '-w' '/tmp/graph15847132580900057200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15847132580900057200.bin' '-l' '-1' '-v' '-w' '/tmp/graph15847132580900057200.weights' '-q' '0' '-e' '0.001'
[2024-05-28 05:31:19] [INFO ] Decomposing Gal with order
[2024-05-28 05:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 05:31:19] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-28 05:31:19] [INFO ] Flatten gal took : 16 ms
[2024-05-28 05:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 3 ms.
[2024-05-28 05:31:20] [INFO ] Time to serialize gal into /tmp/LTL8916838607682268179.gal : 2 ms
[2024-05-28 05:31:20] [INFO ] Time to serialize properties into /tmp/LTL11138317838527433802.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/LTL8916838607682268179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11138317838527433802.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 : !((G((F(("(gu0.c12>gu0.out4_5)")||(G(F("(gu4.out6_5>gu4.in3_4)")))))&&(F("(gu0.c12<=gu0.out4_5)")))))
Formula 0 simplified : F(G(!"(gu0.c12>gu0.out4_5)" & FG!"(gu4.out6_5>gu4.in3_4)") | G!"(gu0.c12<=gu0.out4_5)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3157477445549209969
[2024-05-28 05:31:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3157477445549209969
Running compilation step : cd /tmp/ltsmin3157477445549209969;'/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 313 ms.
Running link step : cd /tmp/ltsmin3157477445549209969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3157477445549209969;'/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)))))&&<>(!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-50-LTLCardinality-08 finished in 96085 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((F(p0)&&G(p1))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 101 transition count 528
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 58 place count 81 transition count 352
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 81 transition count 352
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 98 place count 61 transition count 132
Iterating global reduction 1 with 20 rules applied. Total rules applied 118 place count 61 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 59 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 59 transition count 116
Applied a total of 122 rules in 8 ms. Remains 59 /139 variables (removed 80) and now considering 116/528 (removed 412) transitions.
// Phase 1: matrix 116 rows 59 cols
[2024-05-28 05:31:50] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 05:31:50] [INFO ] Implicit Places using invariants in 110 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/139 places, 116/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 58/139 places, 116/528 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GT s10 s15) (GT 1 s48)), p0:(GT s23 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-09 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' '!(X(G((X(G(p0))||(p1&&G(p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 100 transition count 528
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 59 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 79 place count 80 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 98 place count 61 transition count 154
Iterating global reduction 1 with 19 rules applied. Total rules applied 117 place count 61 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 60 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 60 transition count 146
Applied a total of 119 rules in 7 ms. Remains 60 /139 variables (removed 79) and now considering 146/528 (removed 382) transitions.
// Phase 1: matrix 146 rows 60 cols
[2024-05-28 05:31:50] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 05:31:50] [INFO ] Implicit Places using invariants in 109 ms returned [0, 7, 21, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 114 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/139 places, 146/528 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 56/139 places, 146/528 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s26), p2:(AND (GT s21 s2) (GT s52 s1)), p0:(LEQ s21 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 848 steps with 1 reset in 6 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-10 finished in 348 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||G(p1)||G(p2))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 101 transition count 528
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 59 place count 80 transition count 348
Iterating global reduction 1 with 21 rules applied. Total rules applied 80 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 101 place count 59 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 122 place count 59 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 58 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 58 transition count 114
Applied a total of 124 rules in 13 ms. Remains 58 /139 variables (removed 81) and now considering 114/528 (removed 414) transitions.
// Phase 1: matrix 114 rows 58 cols
[2024-05-28 05:31:50] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 05:31:50] [INFO ] Implicit Places using invariants in 80 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/139 places, 114/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 57/139 places, 114/528 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(LEQ 1 s30), p1:(LEQ s8 s5), p0:(LEQ s49 s48)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-11 finished in 320 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(F((G(p0)&&F((p1||X(p2)))))))'
Support contains 7 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 104 transition count 528
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 53 place count 86 transition count 356
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 86 transition count 356
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 87 place count 70 transition count 168
Iterating global reduction 1 with 16 rules applied. Total rules applied 103 place count 70 transition count 168
Applied a total of 103 rules in 5 ms. Remains 70 /139 variables (removed 69) and now considering 168/528 (removed 360) transitions.
// Phase 1: matrix 168 rows 70 cols
[2024-05-28 05:31:51] [INFO ] Computed 16 invariants in 3 ms
[2024-05-28 05:31:51] [INFO ] Implicit Places using invariants in 134 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/139 places, 168/528 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 69/139 places, 168/528 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT s14 s66) (GT 3 s38)), p1:(LEQ s15 s5), p2:(LEQ s23 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 173 reset in 831 ms.
Product exploration explored 100000 steps with 171 reset in 875 ms.
Computed a total of 69 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 168
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 (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 694 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 9527 steps, including 11 resets, run visited all 3 properties in 24 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 1228 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 168 rows 69 cols
[2024-05-28 05:31:55] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 05:31:55] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-28 05:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:31:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-28 05:31:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:31:56] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 05:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:31:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 05:31:56] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 136 transitions) in 17 ms.
[2024-05-28 05:31:56] [INFO ] Added : 19 causal constraints over 4 iterations in 85 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 168/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-28 05:31:56] [INFO ] Invariant cache hit.
[2024-05-28 05:31:56] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 05:31:56] [INFO ] Invariant cache hit.
[2024-05-28 05:31:56] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-28 05:31:56] [INFO ] Invariant cache hit.
[2024-05-28 05:31:56] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 69/69 places, 168/168 transitions.
Computed a total of 69 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 168
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 (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 691 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10011 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
Finished Best-First random walk after 601 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=150 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 1289 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2024-05-28 05:31:59] [INFO ] Invariant cache hit.
[2024-05-28 05:31:59] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-28 05:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:31:59] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-28 05:31:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:31:59] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-28 05:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:31:59] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-28 05:31:59] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 136 transitions) in 12 ms.
[2024-05-28 05:31:59] [INFO ] Added : 18 causal constraints over 5 iterations in 102 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 164 reset in 811 ms.
Product exploration explored 100000 steps with 179 reset in 841 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-28 05:32:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 05:32:01] [INFO ] Invariant cache hit.
[2024-05-28 05:32:01] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 69/69 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin11326821834212024674
[2024-05-28 05:32:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11326821834212024674
Running compilation step : cd /tmp/ltsmin11326821834212024674;'/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 468 ms.
Running link step : cd /tmp/ltsmin11326821834212024674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11326821834212024674;'/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' '--hoa' '/tmp/stateBased11458437560106562459.hoa' '--buchi-type=spotba'
LTSmin run took 1175 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-50-LTLCardinality-12 finished in 12553 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&&(p0 U (p1||G(p0)))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Graph (complete) has 1253 edges and 139 vertex of which 102 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 83 transition count 356
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 83 transition count 356
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 57 place count 65 transition count 150
Iterating global reduction 0 with 18 rules applied. Total rules applied 75 place count 65 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 77 place count 63 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 63 transition count 134
Applied a total of 79 rules in 13 ms. Remains 63 /139 variables (removed 76) and now considering 134/528 (removed 394) transitions.
// Phase 1: matrix 134 rows 63 cols
[2024-05-28 05:32:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 05:32:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 05:32:03] [INFO ] Invariant cache hit.
[2024-05-28 05:32:03] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-28 05:32:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 05:32:03] [INFO ] Invariant cache hit.
[2024-05-28 05:32:04] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/139 places, 134/528 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 63/139 places, 134/528 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s14 s7)], 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 124 reset in 665 ms.
Product exploration explored 100000 steps with 124 reset in 704 ms.
Computed a total of 63 stabilizing places and 134 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 134
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 92 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 1489 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=744 )
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 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-28 05:32:05] [INFO ] Invariant cache hit.
[2024-05-28 05:32:05] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-28 05:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:32:05] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 05:32:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:32:06] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-28 05:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:32:06] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-28 05:32:06] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 118 transitions) in 17 ms.
[2024-05-28 05:32:06] [INFO ] Added : 10 causal constraints over 3 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-28 05:32:06] [INFO ] Invariant cache hit.
[2024-05-28 05:32:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 05:32:06] [INFO ] Invariant cache hit.
[2024-05-28 05:32:06] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-28 05:32:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 05:32:06] [INFO ] Invariant cache hit.
[2024-05-28 05:32:06] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 63/63 places, 134/134 transitions.
Computed a total of 63 stabilizing places and 134 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 134
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 93 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)]
Incomplete random walk after 10020 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 1) seen :0
Finished Best-First random walk after 3309 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=551 )
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 119 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)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-28 05:32:07] [INFO ] Invariant cache hit.
[2024-05-28 05:32:07] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-28 05:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 05:32:07] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-28 05:32:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:32:07] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 9 ms returned sat
[2024-05-28 05:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 05:32:07] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-28 05:32:07] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-28 05:32:07] [INFO ] Added : 10 causal constraints over 3 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 124 reset in 671 ms.
Stuttering criterion allowed to conclude after 11213 steps with 13 reset in 79 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLCardinality-13 finished in 4598 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(X(F(p0)))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 528/528 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 101 transition count 528
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 59 place count 80 transition count 348
Iterating global reduction 1 with 21 rules applied. Total rules applied 80 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 102 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 124 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 56 transition count 102
Applied a total of 128 rules in 8 ms. Remains 56 /139 variables (removed 83) and now considering 102/528 (removed 426) transitions.
// Phase 1: matrix 102 rows 56 cols
[2024-05-28 05:32:08] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 05:32:08] [INFO ] Implicit Places using invariants in 97 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/139 places, 102/528 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 107 ms. Remains : 55/139 places, 102/528 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLCardinality-14 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 820 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=410 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 55 cols
[2024-05-28 05:32:09] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 05:32:09] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 05:32:09] [INFO ] Invariant cache hit.
[2024-05-28 05:32:09] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-28 05:32:09] [INFO ] Invariant cache hit.
[2024-05-28 05:32:09] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 55/55 places, 102/102 transitions.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10008 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17160 steps, run visited all 1 properties in 85 ms. (steps per millisecond=201 )
Probabilistic random walk after 17160 steps, saw 13369 distinct states, run finished after 85 ms. (steps per millisecond=201 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 182 ms.
Product exploration explored 100000 steps with 25000 reset in 200 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 05:32:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 05:32:11] [INFO ] Invariant cache hit.
[2024-05-28 05:32:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 55/55 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin4938401100189026931
[2024-05-28 05:32:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4938401100189026931
Running compilation step : cd /tmp/ltsmin4938401100189026931;'/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 306 ms.
Running link step : cd /tmp/ltsmin4938401100189026931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4938401100189026931;'/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' '--hoa' '/tmp/stateBased4114008283494985023.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA PermAdmissibility-PT-50-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-50-LTLCardinality-14 finished in 3806 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||(X(G(p1)) U (p0&&X(G(p1))))))))'
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||G(F(p1))))&&F(!p0))))'
[2024-05-28 05:32:12] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2234204748464596005
[2024-05-28 05:32:12] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2024-05-28 05:32:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:32:12] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2024-05-28 05:32:12] [INFO ] Applying decomposition
[2024-05-28 05:32:12] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:32:12] [INFO ] Flatten gal took : 35 ms
[2024-05-28 05:32:12] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2024-05-28 05:32:12] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 05:32:12] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2234204748464596005
Running compilation step : cd /tmp/ltsmin2234204748464596005;'/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/graph3932097402452405351.txt' '-o' '/tmp/graph3932097402452405351.bin' '-w' '/tmp/graph3932097402452405351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3932097402452405351.bin' '-l' '-1' '-v' '-w' '/tmp/graph3932097402452405351.weights' '-q' '0' '-e' '0.001'
[2024-05-28 05:32:12] [INFO ] Decomposing Gal with order
[2024-05-28 05:32:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 05:32:12] [INFO ] Removed a total of 851 redundant transitions.
[2024-05-28 05:32:12] [INFO ] Flatten gal took : 129 ms
[2024-05-28 05:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 378 labels/synchronizations in 24 ms.
[2024-05-28 05:32:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality3623228879937265405.gal : 8 ms
[2024-05-28 05:32:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality5621527149114655174.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/LTLCardinality3623228879937265405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5621527149114655174.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...297
Read 3 LTL properties
Checking formula 0 : !((G(F(("((((gu5.aux12_6+gu5.aux12_5)+(gu5.aux12_4+gu5.aux12_3))+((gu5.aux12_2+gu5.aux12_1)+(gu5.aux12_0+gu5.aux12_7)))>=1)")||((X(G("...747
Formula 0 simplified : FG(!"((((gu5.aux12_6+gu5.aux12_5)+(gu5.aux12_4+gu5.aux12_3))+((gu5.aux12_2+gu5.aux12_1)+(gu5.aux12_0+gu5.aux12_7)))>=1)" & (!"((((gu...499
Compilation finished in 2205 ms.
Running link step : cd /tmp/ltsmin2234204748464596005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2234204748464596005;'/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)||(X([]((LTLAPp1==true))) U ((LTLAPp0==true)&&X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: LTL layer: formula: [](<>(((LTLAPp0==true)||(X([]((LTLAPp1==true))) U ((LTLAPp0==true)&&X([]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.062: "[](<>(((LTLAPp0==true)||(X([]((LTLAPp1==true))) U ((LTLAPp0==true)&&X([]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.092: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.165: DFS-FIFO for weak LTL, using special progress label 534
pins2lts-mc-linux64( 0/ 8), 0.165: There are 535 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.165: State length is 140, there are 531 groups
pins2lts-mc-linux64( 0/ 8), 0.165: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.165: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.165: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.165: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.694: ~82 levels ~960 states ~19824 transitions
pins2lts-mc-linux64( 4/ 8), 1.054: ~146 levels ~1920 states ~41120 transitions
pins2lts-mc-linux64( 4/ 8), 1.482: ~282 levels ~3840 states ~85840 transitions
pins2lts-mc-linux64( 4/ 8), 1.673: ~352 levels ~7680 states ~100880 transitions
pins2lts-mc-linux64( 4/ 8), 1.811: ~352 levels ~15360 states ~108728 transitions
pins2lts-mc-linux64( 4/ 8), 2.118: ~352 levels ~30720 states ~125472 transitions
pins2lts-mc-linux64( 4/ 8), 2.672: ~352 levels ~61440 states ~158472 transitions
pins2lts-mc-linux64( 4/ 8), 3.753: ~352 levels ~122880 states ~224080 transitions
pins2lts-mc-linux64( 4/ 8), 5.669: ~352 levels ~245760 states ~359624 transitions
pins2lts-mc-linux64( 6/ 8), 9.142: ~352 levels ~491520 states ~627672 transitions
pins2lts-mc-linux64( 2/ 8), 14.707: ~352 levels ~983040 states ~1181904 transitions
pins2lts-mc-linux64( 2/ 8), 25.756: ~352 levels ~1966080 states ~2333880 transitions
pins2lts-mc-linux64( 2/ 8), 47.511: ~352 levels ~3932160 states ~4665208 transitions
pins2lts-mc-linux64( 2/ 8), 90.760: ~352 levels ~7864320 states ~9212512 transitions
pins2lts-mc-linux64( 7/ 8), 177.887: ~352 levels ~15728640 states ~18467752 transitions
pins2lts-mc-linux64( 0/ 8), 282.735: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 283.708:
pins2lts-mc-linux64( 0/ 8), 283.709: mean standard work distribution: 1.7% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 283.709:
pins2lts-mc-linux64( 0/ 8), 283.709: Explored 24393642 states 29546660 transitions, fanout: 1.211
pins2lts-mc-linux64( 0/ 8), 283.709: Total exploration time 283.530 sec (282.670 sec minimum, 283.116 sec on average)
pins2lts-mc-linux64( 0/ 8), 283.709: States per second: 86035, Transitions per second: 104210
pins2lts-mc-linux64( 0/ 8), 283.709:
pins2lts-mc-linux64( 0/ 8), 283.709: Progress states detected: 4
pins2lts-mc-linux64( 0/ 8), 283.709: Redundant explorations: -0.4049
pins2lts-mc-linux64( 0/ 8), 283.709:
pins2lts-mc-linux64( 0/ 8), 283.709: Queue width: 8B, total height: 2828, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 283.709: Tree memory: 442.9MB, 19.0 B/state, compr.: 3.4%
pins2lts-mc-linux64( 0/ 8), 283.709: Tree fill ratio (roots/leafs): 18.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 283.709: Stored 591 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 283.709: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 283.709: Est. total memory use: 442.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2234204748464596005;'/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)||(X([]((LTLAPp1==true))) U ((LTLAPp0==true)&&X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2234204748464596005;'/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)||(X([]((LTLAPp1==true))) U ((LTLAPp0==true)&&X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 05:54:12] [INFO ] Flatten gal took : 733 ms
[2024-05-28 05:54:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality5530277125971386753.gal : 104 ms
[2024-05-28 05:54:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality16985931965934722176.ltl : 9 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/LTLCardinality5530277125971386753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16985931965934722176.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 : !((G(F(("((((aux12_6+aux12_5)+(aux12_4+aux12_3))+((aux12_2+aux12_1)+(aux12_0+aux12_7)))>=1)")||((X(G("(((((aux9_4+aux9_5)+(aux9_6+aux9...539
Formula 0 simplified : FG(!"((((aux12_6+aux12_5)+(aux12_4+aux12_3))+((aux12_2+aux12_1)+(aux12_0+aux12_7)))>=1)" & (!"((((aux12_6+aux12_5)+(aux12_4+aux12_3)...363
Detected timeout of ITS tools.
[2024-05-28 06:16:15] [INFO ] Flatten gal took : 584 ms
[2024-05-28 06:16:18] [INFO ] Input system was already deterministic with 528 transitions.
[2024-05-28 06:16:18] [INFO ] Transformed 139 places.
[2024-05-28 06:16:18] [INFO ] Transformed 528 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 06:16:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality5898275138478096658.gal : 7 ms
[2024-05-28 06:16:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality10492662649017802442.ltl : 2 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/LTLCardinality5898275138478096658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10492662649017802442.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 : !((G(F(("((((aux12_6+aux12_5)+(aux12_4+aux12_3))+((aux12_2+aux12_1)+(aux12_0+aux12_7)))>=1)")||((X(G("(((((aux9_4+aux9_5)+(aux9_6+aux9...539
Formula 0 simplified : FG(!"((((aux12_6+aux12_5)+(aux12_4+aux12_3))+((aux12_2+aux12_1)+(aux12_0+aux12_7)))>=1)" & (!"((((aux12_6+aux12_5)+(aux12_4+aux12_3)...363
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6127048 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15693356 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-50"
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-50, 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-171654422000122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-50.tgz
mv PermAdmissibility-PT-50 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 ;