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.r197-tall-171640625300287.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 GPPP-PT-C1000N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625300287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000001000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716551561764

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=GPPP-PT-C1000N0000001000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 11:52:43] [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-24 11:52:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:52:43] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2024-05-24 11:52:43] [INFO ] Transformed 33 places.
[2024-05-24 11:52:43] [INFO ] Transformed 22 transitions.
[2024-05-24 11:52:43] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 81 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 5 formulas.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 11:52:43] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-24 11:52:43] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 11:52:43] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-24 11:52:43] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 11:52:43] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-24 11:52:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 23 out of 32 places after structural reductions.
[2024-05-24 11:52:44] [INFO ] Flatten gal took : 18 ms
[2024-05-24 11:52:44] [INFO ] Flatten gal took : 6 ms
[2024-05-24 11:52:44] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=522 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:44] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-24 11:52:44] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 11:52:44] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-24 11:52:44] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 11:52:44] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 3 properties in 291 ms.
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 26 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 14
Applied a total of 15 rules in 14 ms. Remains 23 /32 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-24 11:52:44] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:44] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 23/32 places, 14/22 transitions.
Incomplete random walk after 12005 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1333 ) properties (out of 1) seen :0
Finished Best-First random walk after 203 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=203 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
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&&F(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:45] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 31/32 places, 22/22 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 354 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s2 s1), p0:(GT 3 s8)], 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 10 reset in 204 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-00 finished in 739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 14
Applied a total of 17 rules in 11 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-24 11:52:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-24 11:52:45] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2024-05-24 11:52:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:52:45] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s4 s0), p1:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-03 finished in 221 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)) U G(p1)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 9 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 26 transition count 16
Applied a total of 11 rules in 6 ms. Remains 26 /32 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 16 rows 26 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [0, 2, 16]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 92 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 16/22 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 14
Applied a total of 4 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 21 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/32 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 21/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s18 s4), p0:(LEQ 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-04 finished in 308 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)&&(F(!p1) U G((!p0||X(p2))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 77 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), true, p1]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s16 s14), p1:(OR (LEQ 1 s5) (LEQ s16 s14)), p2:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28230 steps with 3 reset in 46 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-06 finished in 409 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)) U p1))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 8 ms. Remains 27 /32 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 17 rows 27 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 17 rows 27 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [0, 2, 17]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 72 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 places, 17/22 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 15
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 22 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2024-05-24 11:52:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:52:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/32 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 22/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ s1 s6) (LEQ 1 s2)), p0:(LEQ s3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-07 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-24 11:52:47] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:47] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 2 s5), p1:(OR (LEQ s21 s28) (LEQ 3 s24))], 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 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (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 4 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-08 finished in 469 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)||X(G(p2))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:47] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(LEQ s16 s9), p1:(GT s13 s5), p2:(AND (GT s16 s9) (GT 2 s10))], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-09 finished in 459 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((F(p1)||(p2&&X(G(!p0)))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-24 11:52:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:47] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:48] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:52:48] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(LEQ s18 s20), p1:(GT s25 s16), p2:(GT s28 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 65 reset in 111 ms.
Product exploration explored 100000 steps with 38 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 160 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1091 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:52:49] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:49] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 11:52:49] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 11:52:49] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 11:52:49] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 17941 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=780 )
Parikh walk visited 2 properties in 316 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 26 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 22 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 20 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 19 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 18 transition count 11
Applied a total of 21 rules in 12 ms. Remains 18 /30 variables (removed 12) and now considering 11/22 (removed 11) transitions.
// Phase 1: matrix 11 rows 18 cols
[2024-05-24 11:52:49] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 18/30 places, 11/22 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2502 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3819365 steps, run timeout after 3001 ms. (steps per millisecond=1272 ) properties seen :{}
Probabilistic random walk after 3819365 steps, saw 810251 distinct states, run finished after 3007 ms. (steps per millisecond=1270 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 18 cols
[2024-05-24 11:52:52] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-24 11:52:52] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:52:52] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:52:52] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 11:52:52] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5010 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=556 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p1))), (F p1), (F (NOT p0)), (F (AND p2 (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 18 factoid took 560 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:52:53] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:52:53] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:53] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:52:53] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:52:53] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 30/30 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p0), (X (X (AND p2 (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 180 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1334 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:52:54] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 11:52:54] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 11:52:54] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 11:52:54] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 16818 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=989 )
Parikh walk visited 2 properties in 166 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 26 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 22 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 20 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 19 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 18 transition count 11
Applied a total of 21 rules in 7 ms. Remains 18 /30 variables (removed 12) and now considering 11/22 (removed 11) transitions.
// Phase 1: matrix 11 rows 18 cols
[2024-05-24 11:52:54] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 18/30 places, 11/22 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4407733 steps, run timeout after 3001 ms. (steps per millisecond=1468 ) properties seen :{}
Probabilistic random walk after 4407733 steps, saw 941485 distinct states, run finished after 3001 ms. (steps per millisecond=1468 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 18 cols
[2024-05-24 11:52:57] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:52:58] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:52:58] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:52:58] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 11:52:58] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5986 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=665 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p0), (X (X (AND p2 (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 18 factoid took 525 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Product exploration explored 100000 steps with 54 reset in 90 ms.
Product exploration explored 100000 steps with 105 reset in 110 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 2 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 29 /30 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 29 cols
[2024-05-24 11:52:59] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 11:52:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 29 cols
[2024-05-24 11:52:59] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:52:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 21/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 29/30 places, 21/22 transitions.
Built C files in :
/tmp/ltsmin16856207126679186292
[2024-05-24 11:52:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16856207126679186292
Running compilation step : cd /tmp/ltsmin16856207126679186292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin16856207126679186292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16856207126679186292;'/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/stateBased8138558298999037914.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:53:15] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:53:15] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:53:15] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:53:15] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:53:15] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-24 11:53:15] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2024-05-24 11:53:15] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:53:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 30/30 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin10791083922987437386
[2024-05-24 11:53:15] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10791083922987437386
Running compilation step : cd /tmp/ltsmin10791083922987437386;'/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 100 ms.
Running link step : cd /tmp/ltsmin10791083922987437386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10791083922987437386;'/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/stateBased6413102213872419605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 11:53:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:53:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:53:30] [INFO ] Time to serialize gal into /tmp/LTL18431797402274811150.gal : 1 ms
[2024-05-24 11:53:30] [INFO ] Time to serialize properties into /tmp/LTL9754656654684670522.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/LTL18431797402274811150.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10215728051860471170.hoa' '-atoms' '/tmp/LTL9754656654684670522.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/LTL9754656654684670522.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10215728051860471170.hoa
Detected timeout of ITS tools.
[2024-05-24 11:53:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:53:45] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:53:45] [INFO ] Time to serialize gal into /tmp/LTL13994437344146458473.gal : 1 ms
[2024-05-24 11:53:45] [INFO ] Time to serialize properties into /tmp/LTL5565715653551168683.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/LTL13994437344146458473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5565715653551168683.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(_2PG<=Pyr)"))||(G((F("(b2>_1_3_BPG)"))||(("(c1>c2)")&&(X(G("(_2PG>Pyr)"))))))))
Formula 0 simplified : F!"(_2PG<=Pyr)" & F(G!"(b2>_1_3_BPG)" & (!"(c1>c2)" | XF!"(_2PG>Pyr)"))
Detected timeout of ITS tools.
[2024-05-24 11:54:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:54:00] [INFO ] Applying decomposition
[2024-05-24 11:54:00] [INFO ] Flatten gal took : 2 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/graph14805732708524865999.txt' '-o' '/tmp/graph14805732708524865999.bin' '-w' '/tmp/graph14805732708524865999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14805732708524865999.bin' '-l' '-1' '-v' '-w' '/tmp/graph14805732708524865999.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:54:00] [INFO ] Decomposing Gal with order
[2024-05-24 11:54:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:54:00] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-24 11:54:00] [INFO ] Flatten gal took : 22 ms
[2024-05-24 11:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 11:54:00] [INFO ] Time to serialize gal into /tmp/LTL4662777097171754924.gal : 1 ms
[2024-05-24 11:54:00] [INFO ] Time to serialize properties into /tmp/LTL3642789274803793165.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/LTL4662777097171754924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3642789274803793165.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("(gu3._2PG<=gu3.Pyr)"))||(G((F("(gu6.b2>gu6._1_3_BPG)"))||(("(gu8.c1>gu8.c2)")&&(X(G("(gu3._2PG>gu3.Pyr)"))))))))
Formula 0 simplified : F!"(gu3._2PG<=gu3.Pyr)" & F(G!"(gu6.b2>gu6._1_3_BPG)" & (!"(gu8.c1>gu8.c2)" | XF!"(gu3._2PG>gu3.Pyr)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10786278872129469752
[2024-05-24 11:54:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10786278872129469752
Running compilation step : cd /tmp/ltsmin10786278872129469752;'/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 90 ms.
Running link step : cd /tmp/ltsmin10786278872129469752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10786278872129469752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-10 finished in 102799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:54:30] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:54:30] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:30] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2024-05-24 11:54:30] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s2 s7), p0:(LEQ s0 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5109 steps with 0 reset in 16 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-12 finished in 261 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' '!((p0 U (!p0&&(p1 U p2))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 12 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-24 11:54:31] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-24 11:54:31] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:31] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2024-05-24 11:54:31] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:54:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 23/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p2), (OR (NOT p2) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(LEQ 2 s11), p1:(LEQ 1 s17), p0:(GT 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-15 finished in 197 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((F(p1)||(p2&&X(G(!p0)))))))'
Found a Lengthening insensitive property : GPPP-PT-C1000N0000001000-LTLCardinality-10
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 7 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2024-05-24 11:54:31] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 17 rows 25 cols
[2024-05-24 11:54:31] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:31] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2024-05-24 11:54:31] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:54:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 56 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/32 places, 17/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 88 ms. Remains : 22/32 places, 17/22 transitions.
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(LEQ s11 s13), p1:(GT s17 s9), p2:(GT s20 s21)], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 74 reset in 85 ms.
Product exploration explored 100000 steps with 71 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 15 factoid took 368 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:32] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:32] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 11:54:32] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 11:54:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:54:32] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 11:54:32] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 11:54:32] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 8114 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1014 )
Parikh walk visited 2 properties in 74 ms.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 17/17 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 18 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 11
Applied a total of 11 rules in 11 ms. Remains 17 /22 variables (removed 5) and now considering 11/17 (removed 6) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-24 11:54:32] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:32] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 17/22 places, 11/17 transitions.
Incomplete random walk after 11012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1835 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4720763 steps, run timeout after 3001 ms. (steps per millisecond=1573 ) properties seen :{}
Probabilistic random walk after 4720763 steps, saw 1012121 distinct states, run finished after 3001 ms. (steps per millisecond=1573 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 17 cols
[2024-05-24 11:54:35] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:35] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:54:35] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:54:36] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 11:54:36] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3010 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=602 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (NOT (AND p2 (NOT p1) p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) (NOT p1))), (F p1), (F (NOT p0)), (F (AND p2 (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 15 factoid took 654 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:37] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:37] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:37] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:37] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:54:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:37] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 22/22 places, 17/17 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0))))]
Knowledge based reduction with 15 factoid took 372 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:38] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:38] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 11:54:38] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 11:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:54:38] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 11:54:38] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 11:54:38] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 8147 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1018 )
Parikh walk visited 2 properties in 89 ms.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 17/17 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 14
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 9 place count 18 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 11
Applied a total of 11 rules in 2 ms. Remains 17 /22 variables (removed 5) and now considering 11/17 (removed 6) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-24 11:54:38] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 17/22 places, 11/17 transitions.
Incomplete random walk after 11012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2753 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4509182 steps, run timeout after 3001 ms. (steps per millisecond=1502 ) properties seen :{}
Probabilistic random walk after 4509182 steps, saw 964312 distinct states, run finished after 3003 ms. (steps per millisecond=1501 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 17 cols
[2024-05-24 11:54:41] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:41] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 11:54:41] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 11:54:41] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 11:54:41] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5966 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=596 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (F (NOT (AND (NOT p1) p2 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 15 factoid took 666 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Product exploration explored 100000 steps with 53 reset in 75 ms.
Product exploration explored 100000 steps with 55 reset in 108 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:43] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-24 11:54:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:43] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-24 11:54:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 22/22 places, 17/17 transitions.
Built C files in :
/tmp/ltsmin10631527742400626717
[2024-05-24 11:54:43] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10631527742400626717
Running compilation step : cd /tmp/ltsmin10631527742400626717;'/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 77 ms.
Running link step : cd /tmp/ltsmin10631527742400626717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10631527742400626717;'/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/stateBased6332769767048453897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:58] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:58] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:58] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:58] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 11:54:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 17 rows 22 cols
[2024-05-24 11:54:58] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-24 11:54:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 22/22 places, 17/17 transitions.
Built C files in :
/tmp/ltsmin5594409314236642945
[2024-05-24 11:54:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5594409314236642945
Running compilation step : cd /tmp/ltsmin5594409314236642945;'/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 82 ms.
Running link step : cd /tmp/ltsmin5594409314236642945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5594409314236642945;'/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/stateBased3430845108721979413.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 11:55:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 11:55:13] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:55:13] [INFO ] Time to serialize gal into /tmp/LTL8142529945159767028.gal : 1 ms
[2024-05-24 11:55:13] [INFO ] Time to serialize properties into /tmp/LTL6405786957205225181.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/LTL8142529945159767028.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12507160281124501395.hoa' '-atoms' '/tmp/LTL6405786957205225181.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/LTL6405786957205225181.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12507160281124501395.hoa
Detected timeout of ITS tools.
[2024-05-24 11:55:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:55:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:55:28] [INFO ] Time to serialize gal into /tmp/LTL4731656005540088892.gal : 1 ms
[2024-05-24 11:55:28] [INFO ] Time to serialize properties into /tmp/LTL5094614229044244145.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/LTL4731656005540088892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5094614229044244145.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("(_2PG<=Pyr)"))||(G((F("(b2>_1_3_BPG)"))||(("(c1>c2)")&&(X(G("(_2PG>Pyr)"))))))))
Formula 0 simplified : F!"(_2PG<=Pyr)" & F(G!"(b2>_1_3_BPG)" & (!"(c1>c2)" | XF!"(_2PG>Pyr)"))
Detected timeout of ITS tools.
[2024-05-24 11:55:43] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:55:43] [INFO ] Applying decomposition
[2024-05-24 11:55:43] [INFO ] Flatten gal took : 2 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/graph18400672800387127102.txt' '-o' '/tmp/graph18400672800387127102.bin' '-w' '/tmp/graph18400672800387127102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18400672800387127102.bin' '-l' '-1' '-v' '-w' '/tmp/graph18400672800387127102.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:55:43] [INFO ] Decomposing Gal with order
[2024-05-24 11:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:55:43] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-24 11:55:43] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:55:43] [INFO ] Time to serialize gal into /tmp/LTL4762130955467988169.gal : 1 ms
[2024-05-24 11:55:43] [INFO ] Time to serialize properties into /tmp/LTL16115997680362270849.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/LTL4762130955467988169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16115997680362270849.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(gu3._2PG<=gu3.Pyr)"))||(G((F("(gu2.b2>gu2._1_3_BPG)"))||(("(gu5.c1>gu5.c2)")&&(X(G("(gu3._2PG>gu3.Pyr)"))))))))
Formula 0 simplified : F!"(gu3._2PG<=gu3.Pyr)" & F(G!"(gu2.b2>gu2._1_3_BPG)" & (!"(gu5.c1>gu5.c2)" | XF!"(gu3._2PG>gu3.Pyr)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8243552377521039257
[2024-05-24 11:55:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8243552377521039257
Running compilation step : cd /tmp/ltsmin8243552377521039257;'/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 80 ms.
Running link step : cd /tmp/ltsmin8243552377521039257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8243552377521039257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-10 finished in 102648 ms.
[2024-05-24 11:56:13] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3225027250253108251
[2024-05-24 11:56:13] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-24 11:56:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 11:56:13] [INFO ] Applying decomposition
[2024-05-24 11:56:13] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-24 11:56:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 11:56:13] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-24 11:56:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 11:56:13] [INFO ] Flatten gal took : 2 ms
[2024-05-24 11:56:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3225027250253108251
Running compilation step : cd /tmp/ltsmin3225027250253108251;'/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/graph8677185129774759793.txt' '-o' '/tmp/graph8677185129774759793.bin' '-w' '/tmp/graph8677185129774759793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8677185129774759793.bin' '-l' '-1' '-v' '-w' '/tmp/graph8677185129774759793.weights' '-q' '0' '-e' '0.001'
[2024-05-24 11:56:13] [INFO ] Decomposing Gal with order
[2024-05-24 11:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 11:56:13] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-24 11:56:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 11:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 11:56:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality8087897255722435556.gal : 0 ms
[2024-05-24 11:56:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality10746498613608911445.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/LTLCardinality8087897255722435556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10746498613608911445.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((G("(gu4._2PG<=gu4.Pyr)"))||(G((F("(gu5.b2>gu5._1_3_BPG)"))||(("(gu7.c1>gu7.c2)")&&(X(G("(gu4._2PG>gu4.Pyr)"))))))))
Formula 0 simplified : F!"(gu4._2PG<=gu4.Pyr)" & F(G!"(gu5.b2>gu5._1_3_BPG)" & (!"(gu7.c1>gu7.c2)" | XF!"(gu4._2PG>gu4.Pyr)"))
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin3225027250253108251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3225027250253108251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: ([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.003: "([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: 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( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.081: DFS-FIFO for weak LTL, using special progress label 26
pins2lts-mc-linux64( 0/ 8), 0.081: There are 27 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.081: State length is 33, there are 38 groups
pins2lts-mc-linux64( 0/ 8), 0.081: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.081: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.081: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.081: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.094: ~1 levels ~960 states ~3216 transitions
pins2lts-mc-linux64( 4/ 8), 0.101: ~1 levels ~1920 states ~7464 transitions
pins2lts-mc-linux64( 4/ 8), 0.126: ~1 levels ~3840 states ~16672 transitions
pins2lts-mc-linux64( 4/ 8), 0.185: ~1 levels ~7680 states ~37456 transitions
pins2lts-mc-linux64( 4/ 8), 0.263: ~1 levels ~15360 states ~82856 transitions
pins2lts-mc-linux64( 4/ 8), 0.430: ~1 levels ~30720 states ~181720 transitions
pins2lts-mc-linux64( 2/ 8), 0.702: ~1 levels ~61440 states ~378776 transitions
pins2lts-mc-linux64( 3/ 8), 1.121: ~1 levels ~122880 states ~799464 transitions
pins2lts-mc-linux64( 3/ 8), 1.662: ~1 levels ~245760 states ~1647072 transitions
pins2lts-mc-linux64( 3/ 8), 2.493: ~1 levels ~491520 states ~3457288 transitions
pins2lts-mc-linux64( 3/ 8), 3.557: ~1 levels ~983040 states ~7243936 transitions
pins2lts-mc-linux64( 4/ 8), 5.309: ~1 levels ~1966080 states ~15152016 transitions
pins2lts-mc-linux64( 4/ 8), 8.704: ~1 levels ~3932160 states ~30747136 transitions
pins2lts-mc-linux64( 4/ 8), 16.104: ~1 levels ~7864320 states ~62672976 transitions
pins2lts-mc-linux64( 4/ 8), 31.428: ~1 levels ~15728640 states ~127136088 transitions
pins2lts-mc-linux64( 4/ 8), 63.045: ~1 levels ~31457280 states ~258120688 transitions
pins2lts-mc-linux64( 4/ 8), 128.942: ~1 levels ~62914560 states ~522581128 transitions
pins2lts-mc-linux64( 3/ 8), 278.511: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 278.537:
pins2lts-mc-linux64( 0/ 8), 278.537: mean standard work distribution: 2.7% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 278.537:
pins2lts-mc-linux64( 0/ 8), 278.537: Explored 114880452 states 989569433 transitions, fanout: 8.614
pins2lts-mc-linux64( 0/ 8), 278.537: Total exploration time 278.440 sec (278.400 sec minimum, 278.424 sec on average)
pins2lts-mc-linux64( 0/ 8), 278.537: States per second: 412586, Transitions per second: 3553977
pins2lts-mc-linux64( 0/ 8), 278.537:
pins2lts-mc-linux64( 0/ 8), 278.537: Progress states detected: 134217186
pins2lts-mc-linux64( 0/ 8), 278.537: Redundant explorations: -14.4071
pins2lts-mc-linux64( 0/ 8), 278.537:
pins2lts-mc-linux64( 0/ 8), 278.537: Queue width: 8B, total height: 42133517, memory: 321.45MB
pins2lts-mc-linux64( 0/ 8), 278.537: Tree memory: 1231.5MB, 9.6 B/state, compr.: 7.2%
pins2lts-mc-linux64( 0/ 8), 278.537: Tree fill ratio (roots/leafs): 99.0%/81.0%
pins2lts-mc-linux64( 0/ 8), 278.537: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 278.537: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 278.537: Est. total memory use: 1553.0MB (~1345.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3225027250253108251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3225027250253108251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))||((LTLAPp2==true)&&X([](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 12:17:37] [INFO ] Flatten gal took : 132 ms
[2024-05-24 12:17:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality15777888649398072013.gal : 38 ms
[2024-05-24 12:17:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality9270274171009527104.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/LTLCardinality15777888649398072013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9270274171009527104.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((G("(_2PG<=Pyr)"))||(G((F("(b2>_1_3_BPG)"))||(("(c1>c2)")&&(X(G("(_2PG>Pyr)"))))))))
Formula 0 simplified : F!"(_2PG<=Pyr)" & F(G!"(b2>_1_3_BPG)" & (!"(c1>c2)" | XF!"(_2PG>Pyr)"))
Detected timeout of ITS tools.
[2024-05-24 12:39:06] [INFO ] Flatten gal took : 124 ms
[2024-05-24 12:39:07] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-24 12:39:07] [INFO ] Transformed 32 places.
[2024-05-24 12:39:07] [INFO ] Transformed 22 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-24 12:39:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality608887818672141403.gal : 5 ms
[2024-05-24 12:39:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality5672702572703011067.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/LTLCardinality608887818672141403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5672702572703011067.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...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(_2PG<=Pyr)"))||(G((F("(b2>_1_3_BPG)"))||(("(c1>c2)")&&(X(G("(_2PG>Pyr)"))))))))
Formula 0 simplified : F!"(_2PG<=Pyr)" & F(G!"(b2>_1_3_BPG)" & (!"(c1>c2)" | XF!"(_2PG>Pyr)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 4757900 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16023244 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="GPPP-PT-C1000N0000001000"
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 GPPP-PT-C1000N0000001000, 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 r197-tall-171640625300287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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