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.r109-tall-171624208500402.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 DES-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 08:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 08:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 08:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 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 DES-PT-02b-LTLCardinality-00
FORMULA_NAME DES-PT-02b-LTLCardinality-01
FORMULA_NAME DES-PT-02b-LTLCardinality-02
FORMULA_NAME DES-PT-02b-LTLCardinality-03
FORMULA_NAME DES-PT-02b-LTLCardinality-04
FORMULA_NAME DES-PT-02b-LTLCardinality-05
FORMULA_NAME DES-PT-02b-LTLCardinality-06
FORMULA_NAME DES-PT-02b-LTLCardinality-07
FORMULA_NAME DES-PT-02b-LTLCardinality-08
FORMULA_NAME DES-PT-02b-LTLCardinality-09
FORMULA_NAME DES-PT-02b-LTLCardinality-10
FORMULA_NAME DES-PT-02b-LTLCardinality-11
FORMULA_NAME DES-PT-02b-LTLCardinality-12
FORMULA_NAME DES-PT-02b-LTLCardinality-13
FORMULA_NAME DES-PT-02b-LTLCardinality-14
FORMULA_NAME DES-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716332835986

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=DES-PT-02b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 23:07:17] [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-21 23:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:07:17] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-21 23:07:17] [INFO ] Transformed 288 places.
[2024-05-21 23:07:17] [INFO ] Transformed 239 transitions.
[2024-05-21 23:07:17] [INFO ] Found NUPN structural information;
[2024-05-21 23:07:17] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-02b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 261 transition count 215
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 261 transition count 215
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 245 transition count 199
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 245 transition count 199
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 95 place count 245 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 244 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 244 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 244 transition count 185
Applied a total of 98 rules in 59 ms. Remains 244 /288 variables (removed 44) and now considering 185/239 (removed 54) transitions.
// Phase 1: matrix 185 rows 244 cols
[2024-05-21 23:07:18] [INFO ] Computed 62 invariants in 14 ms
[2024-05-21 23:07:18] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 23:07:18] [INFO ] Invariant cache hit.
[2024-05-21 23:07:18] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 509 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/288 places, 185/239 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 243/288 places, 185/239 transitions.
Support contains 32 out of 243 places after structural reductions.
[2024-05-21 23:07:18] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:07:18] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:07:18] [INFO ] Input system was already deterministic with 185 transitions.
Support contains 30 out of 243 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 243 cols
[2024-05-21 23:07:18] [INFO ] Computed 61 invariants in 9 ms
[2024-05-21 23:07:19] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:07:19] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2024-05-21 23:07:19] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:07:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:07:19] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 10 ms returned sat
[2024-05-21 23:07:19] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:07:19] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-21 23:07:19] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 2 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 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 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 237 transition count 165
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 221 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 221 transition count 153
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 209 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 208 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 208 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 208 transition count 151
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 212 place count 132 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 place count 130 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 128 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 127 transition count 75
Applied a total of 219 rules in 75 ms. Remains 127 /243 variables (removed 116) and now considering 75/185 (removed 110) transitions.
// Phase 1: matrix 75 rows 127 cols
[2024-05-21 23:07:19] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:07:20] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-21 23:07:20] [INFO ] Invariant cache hit.
[2024-05-21 23:07:20] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-21 23:07:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:07:20] [INFO ] Invariant cache hit.
[2024-05-21 23:07:20] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/243 places, 75/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 747 ms. Remains : 127/243 places, 75/185 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 155 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5555 reset in 374 ms.
Product exploration explored 100000 steps with 5570 reset in 287 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/127 stabilizing places and 19/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 120 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 52 ms :[(NOT p0)]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-21 23:07:21] [INFO ] Invariant cache hit.
[2024-05-21 23:07:21] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 23:07:21] [INFO ] Invariant cache hit.
[2024-05-21 23:07:22] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-21 23:07:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:07:22] [INFO ] Invariant cache hit.
[2024-05-21 23:07:22] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 127/127 places, 75/75 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/127 stabilizing places and 19/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5545 reset in 219 ms.
Product exploration explored 100000 steps with 5585 reset in 241 ms.
Built C files in :
/tmp/ltsmin12385689714565516958
[2024-05-21 23:07:22] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-21 23:07:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:22] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-21 23:07:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:22] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-21 23:07:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:22] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12385689714565516958
Running compilation step : cd /tmp/ltsmin12385689714565516958;'/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/ltsmin12385689714565516958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12385689714565516958;'/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/stateBased13486362366827350911.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 75/75 transitions.
Applied a total of 0 rules in 13 ms. Remains 127 /127 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-21 23:07:38] [INFO ] Invariant cache hit.
[2024-05-21 23:07:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 23:07:38] [INFO ] Invariant cache hit.
[2024-05-21 23:07:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 23:07:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:07:38] [INFO ] Invariant cache hit.
[2024-05-21 23:07:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 127/127 places, 75/75 transitions.
Built C files in :
/tmp/ltsmin6018500812338258327
[2024-05-21 23:07:38] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-21 23:07:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:38] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-21 23:07:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:38] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-21 23:07:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6018500812338258327
Running compilation step : cd /tmp/ltsmin6018500812338258327;'/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 199 ms.
Running link step : cd /tmp/ltsmin6018500812338258327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6018500812338258327;'/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/stateBased3939133598178568533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:07:53] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:07:53] [INFO ] Time to serialize gal into /tmp/LTL2491030965536496846.gal : 3 ms
[2024-05-21 23:07:53] [INFO ] Time to serialize properties into /tmp/LTL8378301713904587406.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/LTL2491030965536496846.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5103237577919270972.hoa' '-atoms' '/tmp/LTL8378301713904587406.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/LTL8378301713904587406.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5103237577919270972.hoa
Detected timeout of ITS tools.
[2024-05-21 23:08:08] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:08:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:08:08] [INFO ] Time to serialize gal into /tmp/LTL5629951012827627317.gal : 2 ms
[2024-05-21 23:08:08] [INFO ] Time to serialize properties into /tmp/LTL15244479981047639245.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/LTL5629951012827627317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15244479981047639245.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("(p263!=1)"))))
Formula 0 simplified : GF!"(p263!=1)"
Detected timeout of ITS tools.
[2024-05-21 23:08:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:08:23] [INFO ] Applying decomposition
[2024-05-21 23:08:23] [INFO ] Flatten gal took : 6 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/graph6531337385000440152.txt' '-o' '/tmp/graph6531337385000440152.bin' '-w' '/tmp/graph6531337385000440152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6531337385000440152.bin' '-l' '-1' '-v' '-w' '/tmp/graph6531337385000440152.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:08:23] [INFO ] Decomposing Gal with order
[2024-05-21 23:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:08:23] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-21 23:08:23] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2024-05-21 23:08:23] [INFO ] Time to serialize gal into /tmp/LTL3502108050886304055.gal : 3 ms
[2024-05-21 23:08:23] [INFO ] Time to serialize properties into /tmp/LTL4010128136376982357.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/LTL3502108050886304055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4010128136376982357.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i13.u42.p263!=1)"))))
Formula 0 simplified : GF!"(i13.u42.p263!=1)"
Reverse transition relation is NOT exact ! Due to transitions t156, t7_t48_t39, t9_t34, t147_t34, t146_t25, t106_t107_t119_t184_t126_t127_t121_t115_t116, u...394
Computing Next relation with stutter on 89695 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
659 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.6146,292120,1,0,819270,1316,1260,645618,434,6566,1022946
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-02b-LTLCardinality-01 finished in 72628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 15 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:08:32] [INFO ] Computed 61 invariants in 9 ms
[2024-05-21 23:08:32] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:08:32] [INFO ] Invariant cache hit.
[2024-05-21 23:08:32] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 23:08:32] [INFO ] Invariant cache hit.
[2024-05-21 23:08:32] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s88 0) (EQ s145 1)), p0:(EQ s185 0)], 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 202 ms.
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-02b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLCardinality-02 finished in 1082 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 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 237 transition count 165
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 221 transition count 165
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 221 transition count 154
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 210 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 209 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 209 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 209 transition count 152
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 210 place count 133 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 214 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 128 transition count 76
Applied a total of 217 rules in 41 ms. Remains 128 /243 variables (removed 115) and now considering 76/185 (removed 109) transitions.
// Phase 1: matrix 76 rows 128 cols
[2024-05-21 23:08:33] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 23:08:33] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 23:08:33] [INFO ] Invariant cache hit.
[2024-05-21 23:08:33] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 23:08:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:08:33] [INFO ] Invariant cache hit.
[2024-05-21 23:08:33] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/243 places, 76/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 128/243 places, 76/185 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s66 0) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-05 finished in 353 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(X(!p1)))||G(!p1)))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 19 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:08:33] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 23:08:33] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 23:08:33] [INFO ] Invariant cache hit.
[2024-05-21 23:08:34] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 23:08:34] [INFO ] Invariant cache hit.
[2024-05-21 23:08:34] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, p1, p1]
Running random walk in product with property : DES-PT-02b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s172 1), p1:(OR (EQ s21 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3951 reset in 179 ms.
Product exploration explored 100000 steps with 3945 reset in 181 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 27 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[p1, p1, p1, p1, p1, false, (AND p0 p1), false]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:08:35] [INFO ] Invariant cache hit.
[2024-05-21 23:08:35] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:08:35] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-21 23:08:35] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:08:35] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:08:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:08:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:08:35] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:08:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 221 ms
[2024-05-21 23:08:35] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-21 23:08:35] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 236 transition count 161
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 220 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 220 transition count 149
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 208 transition count 149
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 209 place count 133 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 131 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 131 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 130 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 130 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 129 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 128 transition count 74
Applied a total of 218 rules in 34 ms. Remains 128 /241 variables (removed 113) and now considering 74/182 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 128/241 places, 74/182 transitions.
Incomplete random walk after 10000 steps, including 463 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1957356 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :{}
Probabilistic random walk after 1957356 steps, saw 300111 distinct states, run finished after 3003 ms. (steps per millisecond=651 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 128 cols
[2024-05-21 23:08:38] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:08:39] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:08:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:08:39] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:39] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:08:39] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:08:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:08:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2024-05-21 23:08:39] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-21 23:08:39] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/128 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 23:08:39] [INFO ] Invariant cache hit.
[2024-05-21 23:08:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:08:39] [INFO ] Invariant cache hit.
[2024-05-21 23:08:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:39] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-21 23:08:39] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:08:39] [INFO ] Invariant cache hit.
[2024-05-21 23:08:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 128/128 places, 74/74 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 74
Applied a total of 1 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 128 cols
[2024-05-21 23:08:39] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:08:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:08:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 23:08:39] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:08:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-21 23:08:39] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 23:08:39] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 10 factoid took 269 ms. Reduced automaton from 8 states, 27 edges and 2 AP (stutter insensitive) to 8 states, 27 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 336 ms :[p1, p1, p1, p1, p1, false, (AND p0 p1), false]
Stuttering acceptance computed with spot in 327 ms :[p1, p1, p1, p1, p1, false, (AND p0 p1), false]
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:08:40] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:08:40] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:08:40] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-21 23:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:08:41] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2024-05-21 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:08:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2024-05-21 23:08:41] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-21 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:08:41] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-05-21 23:08:41] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-21 23:08:41] [INFO ] Computed and/alt/rep : 180/305/180 causal constraints (skipped 1 transitions) in 10 ms.
[2024-05-21 23:08:42] [INFO ] Added : 160 causal constraints over 33 iterations in 784 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 235 transition count 164
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 221 transition count 164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 221 transition count 152
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 209 transition count 152
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 203 place count 134 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 132 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 130 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 129 transition count 77
Applied a total of 210 rules in 22 ms. Remains 129 /241 variables (removed 112) and now considering 77/182 (removed 105) transitions.
// Phase 1: matrix 77 rows 129 cols
[2024-05-21 23:08:42] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:08:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 23:08:42] [INFO ] Invariant cache hit.
[2024-05-21 23:08:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:42] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 23:08:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:08:42] [INFO ] Invariant cache hit.
[2024-05-21 23:08:42] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/241 places, 77/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 129/241 places, 77/182 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Detected a total of 25/129 stabilizing places and 20/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 400 ms. Reduced automaton from 8 states, 27 edges and 2 AP (stutter insensitive) to 8 states, 27 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 351 ms :[p1, p1, p1, p1, p1, false, (AND p1 p0), false]
Incomplete random walk after 10000 steps, including 512 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:08:43] [INFO ] Invariant cache hit.
[2024-05-21 23:08:43] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:08:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 23:08:43] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:43] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:43] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:08:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:08:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:08:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:08:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 165 ms
[2024-05-21 23:08:43] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 23:08:43] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 77/77 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 129 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 128 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 128 transition count 75
Applied a total of 4 rules in 8 ms. Remains 128 /129 variables (removed 1) and now considering 75/77 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 128/129 places, 75/77 transitions.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1883008 steps, run timeout after 3001 ms. (steps per millisecond=627 ) properties seen :{}
Probabilistic random walk after 1883008 steps, saw 288838 distinct states, run finished after 3001 ms. (steps per millisecond=627 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 128 cols
[2024-05-21 23:08:46] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 23:08:46] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:08:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 23:08:47] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:47] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 168 ms
[2024-05-21 23:08:47] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 23:08:47] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 128/128 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-21 23:08:47] [INFO ] Invariant cache hit.
[2024-05-21 23:08:47] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 23:08:47] [INFO ] Invariant cache hit.
[2024-05-21 23:08:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:47] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 23:08:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:08:47] [INFO ] Invariant cache hit.
[2024-05-21 23:08:47] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 128/128 places, 75/75 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 75
Applied a total of 1 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 128 cols
[2024-05-21 23:08:47] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:08:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:08:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 23:08:47] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:08:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2024-05-21 23:08:47] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 23:08:47] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 442 ms. Reduced automaton from 8 states, 27 edges and 2 AP (stutter insensitive) to 8 states, 27 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 371 ms :[p1, p1, p1, p1, p1, false, (AND p1 p0), false]
Stuttering acceptance computed with spot in 327 ms :[p1, p1, p1, p1, p1, false, (AND p1 p0), false]
// Phase 1: matrix 77 rows 129 cols
[2024-05-21 23:08:48] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:08:48] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:08:48] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 23:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:08:49] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-21 23:08:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:08:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:08:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 23:08:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:08:49] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-21 23:08:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:08:49] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:08:49] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-21 23:08:49] [INFO ] Computed and/alt/rep : 74/253/74 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 23:08:49] [INFO ] Added : 53 causal constraints over 11 iterations in 114 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 346 ms :[p1, p1, p1, p1, p1, false, (AND p1 p0), false]
Stuttering criterion allowed to conclude after 39 steps with 7 reset in 1 ms.
FORMULA DES-PT-02b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-06 finished in 15903 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 U X(G(p0)))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 8 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:08:49] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 23:08:49] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 23:08:49] [INFO ] Invariant cache hit.
[2024-05-21 23:08:50] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 23:08:50] [INFO ] Invariant cache hit.
[2024-05-21 23:08:50] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s164 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1330 steps with 10 reset in 6 ms.
FORMULA DES-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-07 finished in 648 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(p1))&&p0)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 242 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 184
Applied a total of 2 rules in 5 ms. Remains 242 /243 variables (removed 1) and now considering 184/185 (removed 1) transitions.
// Phase 1: matrix 184 rows 242 cols
[2024-05-21 23:08:50] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:08:50] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:08:50] [INFO ] Invariant cache hit.
[2024-05-21 23:08:50] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 23:08:50] [INFO ] Invariant cache hit.
[2024-05-21 23:08:50] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 184/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 242/243 places, 184/185 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s128 0) (EQ s24 1)) (OR (EQ s64 0) (EQ s223 1))), p1:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-09 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((G(F(p1))||G(p2))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 9 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:08:50] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:08:51] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 23:08:51] [INFO ] Invariant cache hit.
[2024-05-21 23:08:51] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 23:08:51] [INFO ] Invariant cache hit.
[2024-05-21 23:08:51] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s119 0) (EQ s47 1)), p2:(OR (EQ s134 0) (EQ s233 1)), p1:(OR (EQ s175 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 910 reset in 241 ms.
Product exploration explored 100000 steps with 915 reset in 224 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 125 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 23:08:52] [INFO ] Invariant cache hit.
[2024-05-21 23:08:52] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 23:08:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:08:53] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2024-05-21 23:08:53] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 23:08:53] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 23:08:53] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 236 transition count 163
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 222 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 221 transition count 162
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 221 transition count 150
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 209 transition count 150
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 205 place count 135 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 209 place count 133 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 133 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 132 transition count 77
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 132 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 131 transition count 76
Applied a total of 213 rules in 22 ms. Remains 131 /241 variables (removed 110) and now considering 76/182 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 131/241 places, 76/182 transitions.
Incomplete random walk after 10000 steps, including 394 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 217835 steps, run visited all 1 properties in 357 ms. (steps per millisecond=610 )
Probabilistic random walk after 217835 steps, saw 33003 distinct states, run finished after 357 ms. (steps per millisecond=610 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 3 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 23:08:54] [INFO ] Invariant cache hit.
[2024-05-21 23:08:54] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:08:54] [INFO ] Invariant cache hit.
[2024-05-21 23:08:54] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 23:08:54] [INFO ] Invariant cache hit.
[2024-05-21 23:08:55] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 241/241 places, 182/182 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X (AND p0 p2))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:08:55] [INFO ] Invariant cache hit.
[2024-05-21 23:08:55] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:08:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:08:55] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2024-05-21 23:08:55] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:08:55] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-21 23:08:55] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 236 transition count 163
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 222 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 221 transition count 162
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 221 transition count 150
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 209 transition count 150
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 205 place count 135 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 209 place count 133 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 133 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 132 transition count 77
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 132 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 131 transition count 76
Applied a total of 213 rules in 24 ms. Remains 131 /241 variables (removed 110) and now considering 76/182 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 131/241 places, 76/182 transitions.
Incomplete random walk after 10000 steps, including 398 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 217835 steps, run visited all 1 properties in 344 ms. (steps per millisecond=633 )
Probabilistic random walk after 217835 steps, saw 33003 distinct states, run finished after 344 ms. (steps per millisecond=633 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X (AND p0 p2))), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 280 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 907 reset in 178 ms.
Product exploration explored 100000 steps with 912 reset in 196 ms.
Applying partial POR strategy [false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 236 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 13 place count 236 transition count 182
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 236 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 232 transition count 178
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 232 transition count 178
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 105 place count 232 transition count 181
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 114 place count 223 transition count 172
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 123 place count 223 transition count 172
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 129 place count 223 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 221 transition count 194
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 221 transition count 194
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 133 rules in 40 ms. Remains 221 /241 variables (removed 20) and now considering 194/182 (removed -12) transitions.
[2024-05-21 23:08:58] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 194 rows 221 cols
[2024-05-21 23:08:58] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 23:08:58] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/241 places, 194/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 221/241 places, 194/182 transitions.
Built C files in :
/tmp/ltsmin11773137590422044086
[2024-05-21 23:08:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11773137590422044086
Running compilation step : cd /tmp/ltsmin11773137590422044086;'/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 315 ms.
Running link step : cd /tmp/ltsmin11773137590422044086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11773137590422044086;'/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/stateBased2460684745585925686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:09:13] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:09:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:09:13] [INFO ] Invariant cache hit.
[2024-05-21 23:09:13] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-21 23:09:13] [INFO ] Invariant cache hit.
[2024-05-21 23:09:14] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 241/241 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin6743337263741228918
[2024-05-21 23:09:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6743337263741228918
Running compilation step : cd /tmp/ltsmin6743337263741228918;'/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 299 ms.
Running link step : cd /tmp/ltsmin6743337263741228918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6743337263741228918;'/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/stateBased8370878871106524322.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:09:29] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:09:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:09:29] [INFO ] Time to serialize gal into /tmp/LTL5561289681873580575.gal : 2 ms
[2024-05-21 23:09:29] [INFO ] Time to serialize properties into /tmp/LTL10633455082588102403.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/LTL5561289681873580575.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16933363721568035643.hoa' '-atoms' '/tmp/LTL10633455082588102403.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/LTL10633455082588102403.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16933363721568035643.hoa
Detected timeout of ITS tools.
[2024-05-21 23:09:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:09:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:09:44] [INFO ] Time to serialize gal into /tmp/LTL8678092490136778180.gal : 2 ms
[2024-05-21 23:09:44] [INFO ] Time to serialize properties into /tmp/LTL3825575849814876764.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/LTL8678092490136778180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3825575849814876764.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("((p161==0)||(p74==1))"))||(X(X((G(F("((p217==0)||(p129==1))")))||(G("((p176==0)||(p280==1))")))))))
Formula 0 simplified : F!"((p161==0)||(p74==1))" & XX(FG!"((p217==0)||(p129==1))" & F!"((p176==0)||(p280==1))")
Detected timeout of ITS tools.
[2024-05-21 23:09:59] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:09:59] [INFO ] Applying decomposition
[2024-05-21 23:09:59] [INFO ] Flatten gal took : 22 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/graph9055181921584371797.txt' '-o' '/tmp/graph9055181921584371797.bin' '-w' '/tmp/graph9055181921584371797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9055181921584371797.bin' '-l' '-1' '-v' '-w' '/tmp/graph9055181921584371797.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:09:59] [INFO ] Decomposing Gal with order
[2024-05-21 23:09:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:09:59] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-21 23:09:59] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:09:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-21 23:09:59] [INFO ] Time to serialize gal into /tmp/LTL3042598537736488261.gal : 4 ms
[2024-05-21 23:09:59] [INFO ] Time to serialize properties into /tmp/LTL5135734601383283761.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/LTL3042598537736488261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5135734601383283761.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !(((G("((i9.i0.u48.p161==0)||(i3.i1.u18.p74==1))"))||(X(X((G(F("((i11.i3.u62.p217==0)||(i5.i1.u32.p129==1))")))||(G("((i9.i0.u48.p176=...185
Formula 0 simplified : F!"((i9.i0.u48.p161==0)||(i3.i1.u18.p74==1))" & XX(FG!"((i11.i3.u62.p217==0)||(i5.i1.u32.p129==1))" & F!"((i9.i0.u48.p176==0)||(i0.u...169
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t136, t146, t147, t179, i0.u78.t17, i1.t120, i1.u9.t126, i1.u9.t127, i1.u1...775
Computing Next relation with stutter on 89695 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2005509084820666218
[2024-05-21 23:10:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2005509084820666218
Running compilation step : cd /tmp/ltsmin2005509084820666218;'/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 294 ms.
Running link step : cd /tmp/ltsmin2005509084820666218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2005509084820666218;'/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(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-02b-LTLCardinality-10 finished in 98759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((X(p1) U p2)||G(p3)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 7 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
[2024-05-21 23:10:29] [INFO ] Invariant cache hit.
[2024-05-21 23:10:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:10:29] [INFO ] Invariant cache hit.
[2024-05-21 23:10:29] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 23:10:29] [INFO ] Invariant cache hit.
[2024-05-21 23:10:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (EQ s34 0) (EQ s161 1)), p2:(EQ s40 1), p0:(EQ s40 0), p3:(EQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2628 reset in 172 ms.
Product exploration explored 100000 steps with 2620 reset in 193 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) p3))), (X p0), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 114 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Finished random walk after 47 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) p3))), (X p0), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
[2024-05-21 23:10:31] [INFO ] Invariant cache hit.
[2024-05-21 23:10:31] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:10:31] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-21 23:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:10:31] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-21 23:10:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:10:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:10:31] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 24 ms returned sat
[2024-05-21 23:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:10:32] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-05-21 23:10:32] [INFO ] Computed and/alt/rep : 180/305/180 causal constraints (skipped 1 transitions) in 17 ms.
[2024-05-21 23:10:32] [INFO ] Added : 162 causal constraints over 33 iterations in 819 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 23:10:32] [INFO ] Invariant cache hit.
[2024-05-21 23:10:33] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 23:10:33] [INFO ] Invariant cache hit.
[2024-05-21 23:10:33] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-21 23:10:33] [INFO ] Invariant cache hit.
[2024-05-21 23:10:33] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 241/241 places, 182/182 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Finished random walk after 137 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
[2024-05-21 23:10:34] [INFO ] Invariant cache hit.
[2024-05-21 23:10:34] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:10:34] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-21 23:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:10:34] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2024-05-21 23:10:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:10:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:10:34] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 26 ms returned sat
[2024-05-21 23:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:10:34] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-21 23:10:34] [INFO ] Computed and/alt/rep : 180/305/180 causal constraints (skipped 1 transitions) in 11 ms.
[2024-05-21 23:10:35] [INFO ] Added : 162 causal constraints over 33 iterations in 822 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2641 reset in 182 ms.
Product exploration explored 100000 steps with 2637 reset in 181 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 236 transition count 179
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 236 transition count 182
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 236 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 231 transition count 177
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 231 transition count 177
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 111 place count 231 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 221 transition count 170
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 221 transition count 170
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 221 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 219 transition count 182
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 219 transition count 182
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 26 ms. Remains 219 /241 variables (removed 22) and now considering 182/182 (removed 0) transitions.
[2024-05-21 23:10:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 182 rows 219 cols
[2024-05-21 23:10:36] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 23:10:36] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/241 places, 182/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 219/241 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin11413727846068745183
[2024-05-21 23:10:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11413727846068745183
Running compilation step : cd /tmp/ltsmin11413727846068745183;'/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 295 ms.
Running link step : cd /tmp/ltsmin11413727846068745183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11413727846068745183;'/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/stateBased5074924068833215735.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:10:51] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:10:51] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:10:51] [INFO ] Invariant cache hit.
[2024-05-21 23:10:51] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-21 23:10:51] [INFO ] Invariant cache hit.
[2024-05-21 23:10:51] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 241/241 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin3054374392936291304
[2024-05-21 23:10:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3054374392936291304
Running compilation step : cd /tmp/ltsmin3054374392936291304;'/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 299 ms.
Running link step : cd /tmp/ltsmin3054374392936291304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3054374392936291304;'/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/stateBased8204097702533800164.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:11:07] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:11:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:11:07] [INFO ] Time to serialize gal into /tmp/LTL631155288871994609.gal : 1 ms
[2024-05-21 23:11:07] [INFO ] Time to serialize properties into /tmp/LTL9592365677991705175.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/LTL631155288871994609.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13397546325391139680.hoa' '-atoms' '/tmp/LTL9592365677991705175.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/LTL9592365677991705175.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13397546325391139680.hoa
Detected timeout of ITS tools.
[2024-05-21 23:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:11:22] [INFO ] Time to serialize gal into /tmp/LTL11672509258570450207.gal : 2 ms
[2024-05-21 23:11:22] [INFO ] Time to serialize properties into /tmp/LTL1570804113001934350.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/LTL11672509258570450207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1570804113001934350.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 : !((X(("(p62==0)")&&(((X("((p51==0)||(p203==1))"))U("(p62==1)"))||(G("(p283==1)"))))))
Formula 0 simplified : X(!"(p62==0)" | (!"(p62==1)" & F!"(p283==1)" & X(!"(p62==1)" W !"((p51==0)||(p203==1))")))
Detected timeout of ITS tools.
[2024-05-21 23:11:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:11:37] [INFO ] Applying decomposition
[2024-05-21 23:11:37] [INFO ] Flatten gal took : 6 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/graph3449263855474182652.txt' '-o' '/tmp/graph3449263855474182652.bin' '-w' '/tmp/graph3449263855474182652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3449263855474182652.bin' '-l' '-1' '-v' '-w' '/tmp/graph3449263855474182652.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:11:37] [INFO ] Decomposing Gal with order
[2024-05-21 23:11:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:11:37] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-21 23:11:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:11:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2024-05-21 23:11:37] [INFO ] Time to serialize gal into /tmp/LTL12648184635254137539.gal : 17 ms
[2024-05-21 23:11:37] [INFO ] Time to serialize properties into /tmp/LTL4026321314037976379.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12648184635254137539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4026321314037976379.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X(("(i6.i1.u14.p62==0)")&&(((X("((i1.u11.p51==0)||(i8.i0.u54.p203==1))"))U("(i6.i1.u14.p62==1)"))||(G("(i11.u78.p283==1)"))))))
Formula 0 simplified : X(!"(i6.i1.u14.p62==0)" | (!"(i6.i1.u14.p62==1)" & F!"(i11.u78.p283==1)" & X(!"(i6.i1.u14.p62==1)" W !"((i1.u11.p51==0)||(i8.i0.u54....168
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t62, t87, t136, t146, t147, t179, i0.t120, i0.u8.t126, i0.u8.t127, i0.u9.t122, i0.u9...751
Computing Next relation with stutter on 89695 deadlock states
52 unique states visited
0 strongly connected components in search stack
51 transitions explored
52 items max in DFS search stack
313 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.15643,122736,1,0,224299,1089,3355,499804,466,3879,325172
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-02b-LTLCardinality-12 finished in 71368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 237 transition count 166
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 221 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 221 transition count 153
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 209 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 208 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 208 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 208 transition count 151
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 206 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 130 transition count 78
Applied a total of 213 rules in 24 ms. Remains 130 /243 variables (removed 113) and now considering 78/185 (removed 107) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-21 23:11:41] [INFO ] Computed 58 invariants in 0 ms
[2024-05-21 23:11:41] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 23:11:41] [INFO ] Invariant cache hit.
[2024-05-21 23:11:41] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-21 23:11:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:11:41] [INFO ] Invariant cache hit.
[2024-05-21 23:11:41] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/243 places, 78/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 130/243 places, 78/185 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s84 0) (NEQ s91 1)), p0:(OR (EQ s25 0) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 548 steps with 32 reset in 2 ms.
FORMULA DES-PT-02b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-14 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((G(F(p1))||G(p2))))))'
Found a Lengthening insensitive property : DES-PT-02b-LTLCardinality-10
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 237 transition count 169
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 225 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 224 transition count 168
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 27 place count 224 transition count 155
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 53 place count 211 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 210 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 210 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 210 transition count 153
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 202 place count 137 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 206 place count 135 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 133 transition count 80
Applied a total of 208 rules in 22 ms. Remains 133 /243 variables (removed 110) and now considering 80/185 (removed 105) transitions.
// Phase 1: matrix 80 rows 133 cols
[2024-05-21 23:11:42] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:11:42] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:11:42] [INFO ] Invariant cache hit.
[2024-05-21 23:11:42] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 23:11:42] [INFO ] Invariant cache hit.
[2024-05-21 23:11:42] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/243 places, 80/185 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 423 ms. Remains : 133/243 places, 80/185 transitions.
Running random walk in product with property : DES-PT-02b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s20 1)), p2:(OR (EQ s64 0) (EQ s128 1)), p1:(OR (EQ s86 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4174 reset in 231 ms.
Product exploration explored 100000 steps with 4234 reset in 256 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 7 factoid took 231 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 416 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-21 23:11:43] [INFO ] Invariant cache hit.
[2024-05-21 23:11:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:11:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 3 ms returned sat
[2024-05-21 23:11:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 4 ms returned sat
[2024-05-21 23:11:43] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 538 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 23:11:44] [INFO ] Invariant cache hit.
[2024-05-21 23:11:45] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 23:11:45] [INFO ] Invariant cache hit.
[2024-05-21 23:11:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-21 23:11:45] [INFO ] Invariant cache hit.
[2024-05-21 23:11:45] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 133/133 places, 80/80 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 409 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:11:45] [INFO ] Invariant cache hit.
[2024-05-21 23:11:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:11:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 23:11:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2024-05-21 23:11:45] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:11:46] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 23:11:46] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 80/80 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 133 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 132 transition count 78
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 132 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 131 transition count 77
Applied a total of 5 rules in 10 ms. Remains 131 /133 variables (removed 2) and now considering 77/80 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 131/133 places, 77/80 transitions.
Incomplete random walk after 10000 steps, including 423 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 1848 steps, including 14 resets, run visited all 1 properties in 3 ms. (steps per millisecond=616 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 437 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4218 reset in 233 ms.
Product exploration explored 100000 steps with 4238 reset in 253 ms.
Applying partial POR strategy [false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 23:11:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:11:48] [INFO ] Invariant cache hit.
[2024-05-21 23:11:48] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 133/133 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin7327986934464725185
[2024-05-21 23:11:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7327986934464725185
Running compilation step : cd /tmp/ltsmin7327986934464725185;'/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 177 ms.
Running link step : cd /tmp/ltsmin7327986934464725185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7327986934464725185;'/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/stateBased4447167046305381468.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 23:12:03] [INFO ] Invariant cache hit.
[2024-05-21 23:12:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 23:12:03] [INFO ] Invariant cache hit.
[2024-05-21 23:12:03] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-21 23:12:03] [INFO ] Invariant cache hit.
[2024-05-21 23:12:03] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 133/133 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin8740013049705253675
[2024-05-21 23:12:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8740013049705253675
Running compilation step : cd /tmp/ltsmin8740013049705253675;'/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 186 ms.
Running link step : cd /tmp/ltsmin8740013049705253675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8740013049705253675;'/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/stateBased7901244959103214033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:12:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:12:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:12:18] [INFO ] Time to serialize gal into /tmp/LTL5127842643293544894.gal : 1 ms
[2024-05-21 23:12:18] [INFO ] Time to serialize properties into /tmp/LTL4863599568624005310.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/LTL5127842643293544894.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12539993814601692680.hoa' '-atoms' '/tmp/LTL4863599568624005310.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/LTL4863599568624005310.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12539993814601692680.hoa
Detected timeout of ITS tools.
[2024-05-21 23:12:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:12:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:12:33] [INFO ] Time to serialize gal into /tmp/LTL8760864356231716042.gal : 1 ms
[2024-05-21 23:12:33] [INFO ] Time to serialize properties into /tmp/LTL1759875009457942714.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/LTL8760864356231716042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1759875009457942714.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("((p161==0)||(p74==1))"))||(X(X((G(F("((p217==0)||(p129==1))")))||(G("((p176==0)||(p280==1))")))))))
Formula 0 simplified : F!"((p161==0)||(p74==1))" & XX(FG!"((p217==0)||(p129==1))" & F!"((p176==0)||(p280==1))")
Detected timeout of ITS tools.
[2024-05-21 23:12:49] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:12:49] [INFO ] Applying decomposition
[2024-05-21 23:12:49] [INFO ] Flatten gal took : 8 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/graph17332603309885640055.txt' '-o' '/tmp/graph17332603309885640055.bin' '-w' '/tmp/graph17332603309885640055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17332603309885640055.bin' '-l' '-1' '-v' '-w' '/tmp/graph17332603309885640055.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:12:49] [INFO ] Decomposing Gal with order
[2024-05-21 23:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:12:49] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-21 23:12:49] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2024-05-21 23:12:49] [INFO ] Time to serialize gal into /tmp/LTL16028788414674869721.gal : 8 ms
[2024-05-21 23:12:49] [INFO ] Time to serialize properties into /tmp/LTL16273127864757660912.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/LTL16028788414674869721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16273127864757660912.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !(((G("((i12.u13.p161==0)||(i1.u5.p74==1))"))||(X(X((G(F("((i5.u37.p217==0)||(i2.u8.p129==1))")))||(G("((i11.u19.p176==0)||(u45.p280==...166
Formula 0 simplified : F!"((i12.u13.p161==0)||(i1.u5.p74==1))" & XX(FG!"((i5.u37.p217==0)||(i2.u8.p129==1))" & F!"((i11.u19.p176==0)||(u45.p280==1))")
Reverse transition relation is NOT exact ! Due to transitions t7_t48_t39, t14_t18_t75_t19_t26_t35_t73_t36_t38_t49_t65_t50_t52_t54_t56_t58_t60_t62_t39, t9_t...462
Computing Next relation with stutter on 89695 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14395483956298782477
[2024-05-21 23:13:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14395483956298782477
Running compilation step : cd /tmp/ltsmin14395483956298782477;'/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 193 ms.
Running link step : cd /tmp/ltsmin14395483956298782477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14395483956298782477;'/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(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-02b-LTLCardinality-10 finished in 97619 ms.
[2024-05-21 23:13:19] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin208362876545190031
[2024-05-21 23:13:19] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-21 23:13:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:19] [INFO ] Applying decomposition
[2024-05-21 23:13:19] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-21 23:13:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:13:19] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-21 23:13:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:19] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin208362876545190031
Running compilation step : cd /tmp/ltsmin208362876545190031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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/graph12464004551671118434.txt' '-o' '/tmp/graph12464004551671118434.bin' '-w' '/tmp/graph12464004551671118434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12464004551671118434.bin' '-l' '-1' '-v' '-w' '/tmp/graph12464004551671118434.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:13:19] [INFO ] Decomposing Gal with order
[2024-05-21 23:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:13:19] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-21 23:13:19] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:13:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-21 23:13:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality17844150985475656438.gal : 2 ms
[2024-05-21 23:13:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality8354187253368498741.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/LTLCardinality17844150985475656438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8354187253368498741.ltl' '-c' '-stutter-deadlock'

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...277
Read 1 LTL properties
Checking formula 0 : !(((G("((i8.u47.p161==0)||(i5.u18.p74==1))"))||(X(X((G(F("((i7.u61.p217==0)||(i6.u32.p129==1))")))||(G("((i8.u47.p176==0)||(i0.u77.p28...169
Formula 0 simplified : F!"((i8.u47.p161==0)||(i5.u18.p74==1))" & XX(FG!"((i7.u61.p217==0)||(i6.u32.p129==1))" & F!"((i8.u47.p176==0)||(i0.u77.p280==1))")
Compilation finished in 350 ms.
Running link step : cd /tmp/ltsmin208362876545190031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin208362876545190031;'/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(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t92, t120, t136, t146, t147, t179, i0.u35.t76, i0.u77.t17, i1.u11.t116, i2...692
Computing Next relation with stutter on 117137 deadlock states
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: LTL layer: formula: ([]((LTLAPp0==true))||X(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))))))
pins2lts-mc-linux64( 5/ 8), 0.003: "([]((LTLAPp0==true))||X(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.089: DFS-FIFO for weak LTL, using special progress label 189
pins2lts-mc-linux64( 0/ 8), 0.089: There are 190 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.089: State length is 244, there are 204 groups
pins2lts-mc-linux64( 0/ 8), 0.089: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.089: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.089: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.089: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.123: ~1 levels ~960 states ~4104 transitions
pins2lts-mc-linux64( 2/ 8), 0.148: ~1 levels ~1920 states ~8784 transitions
pins2lts-mc-linux64( 2/ 8), 0.172: ~1 levels ~3840 states ~18768 transitions
pins2lts-mc-linux64( 2/ 8), 0.220: ~1 levels ~7680 states ~38664 transitions
pins2lts-mc-linux64( 2/ 8), 0.317: ~1 levels ~15360 states ~82088 transitions
pins2lts-mc-linux64( 2/ 8), 0.547: ~1 levels ~30720 states ~182992 transitions
pins2lts-mc-linux64( 2/ 8), 1.002: ~1 levels ~61440 states ~395176 transitions
pins2lts-mc-linux64( 2/ 8), 1.777: ~1 levels ~122880 states ~824808 transitions
pins2lts-mc-linux64( 1/ 8), 3.099: ~1 levels ~245760 states ~1817144 transitions
pins2lts-mc-linux64( 1/ 8), 5.088: ~1 levels ~491520 states ~3654600 transitions
pins2lts-mc-linux64( 1/ 8), 8.496: ~1 levels ~983040 states ~7428848 transitions
pins2lts-mc-linux64( 1/ 8), 14.956: ~1 levels ~1966080 states ~15517832 transitions
pins2lts-mc-linux64( 2/ 8), 28.744: ~1 levels ~3932160 states ~29878968 transitions
pins2lts-mc-linux64( 2/ 8), 58.770: ~1 levels ~7864320 states ~66708720 transitions
pins2lts-mc-linux64( 0/ 8), 128.824: ~1 levels ~15728640 states ~166576440 transitions
pins2lts-mc-linux64( 6/ 8), 268.302: ~1 levels ~31457280 states ~335655496 transitions
pins2lts-mc-linux64( 0/ 8), 540.871: ~1 levels ~62914560 states ~710081608 transitions
pins2lts-mc-linux64( 5/ 8), 736.877: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 736.924:
pins2lts-mc-linux64( 0/ 8), 736.924: mean standard work distribution: 4.2% (states) 3.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 736.924:
pins2lts-mc-linux64( 0/ 8), 736.924: Explored 77822187 states 939016172 transitions, fanout: 12.066
pins2lts-mc-linux64( 0/ 8), 736.924: Total exploration time 736.830 sec (736.770 sec minimum, 736.795 sec on average)
pins2lts-mc-linux64( 0/ 8), 736.924: States per second: 105618, Transitions per second: 1274400
pins2lts-mc-linux64( 0/ 8), 736.924:
pins2lts-mc-linux64( 0/ 8), 736.924: Progress states detected: 134217199
pins2lts-mc-linux64( 0/ 8), 736.924: Redundant explorations: -42.0178
pins2lts-mc-linux64( 0/ 8), 736.924:
pins2lts-mc-linux64( 0/ 8), 736.924: Queue width: 8B, total height: 98703583, memory: 753.05MB
pins2lts-mc-linux64( 0/ 8), 736.924: Tree memory: 1070.4MB, 8.4 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 736.924: Tree fill ratio (roots/leafs): 99.0%/18.0%
pins2lts-mc-linux64( 0/ 8), 736.924: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 736.924: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 736.924: Est. total memory use: 1823.5MB (~1777.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin208362876545190031;'/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(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin208362876545190031;'/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(X(([](<>((LTLAPp1==true)))||[]((LTLAPp2==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-21 23:35:19] [INFO ] Applying decomposition
[2024-05-21 23:35:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:35:19] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:19] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:35:19] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 32 ms.
[2024-05-21 23:35:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality153694513890620523.gal : 5 ms
[2024-05-21 23:35:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality4110233533881022080.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/LTLCardinality153694513890620523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4110233533881022080.ltl' '-c' '-stutter-deadlock'

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("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.u148.p161==0)||(i1.i0.i0.u20.p74==1))"))||(X(X((G(F("((i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u111...292
Formula 0 simplified : F!"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.u148.p161==0)||(i1.i0.i0.u20.p74==1))" & XX(FG!"((i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u111.p217==...276
Reverse transition relation is NOT exact ! Due to transitions t136, i0.t0, i1.i0.i0.i0.u19.t110, i1.i0.i0.i0.i0.u18.t113, i1.i0.i0.i0.i0.i0.u17.t116, i1.i0...1698
Detected timeout of ITS tools.
[2024-05-21 23:57:36] [INFO ] Flatten gal took : 186 ms
[2024-05-21 23:57:37] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-21 23:57:37] [INFO ] Transformed 243 places.
[2024-05-21 23:57:37] [INFO ] Transformed 185 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-21 23:57:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality2455751688972845423.gal : 6 ms
[2024-05-21 23:57:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality1648220791137392615.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2455751688972845423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1648220791137392615.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p161==0)||(p74==1))"))||(X(X((G(F("((p217==0)||(p129==1))")))||(G("((p176==0)||(p280==1))")))))))
Formula 0 simplified : F!"((p161==0)||(p74==1))" & XX(FG!"((p217==0)||(p129==1))" & F!"((p176==0)||(p280==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t10, t17, t25, t34, t37, t48, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, ...421
Computing Next relation with stutter on 117137 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10929632 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16108696 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="DES-PT-02b"
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 DES-PT-02b, 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 r109-tall-171624208500402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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