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.r241-tall-171649628200112.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 Kanban-PT-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628200112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 13 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-10000-LTLCardinality-00
FORMULA_NAME Kanban-PT-10000-LTLCardinality-01
FORMULA_NAME Kanban-PT-10000-LTLCardinality-02
FORMULA_NAME Kanban-PT-10000-LTLCardinality-03
FORMULA_NAME Kanban-PT-10000-LTLCardinality-04
FORMULA_NAME Kanban-PT-10000-LTLCardinality-05
FORMULA_NAME Kanban-PT-10000-LTLCardinality-06
FORMULA_NAME Kanban-PT-10000-LTLCardinality-07
FORMULA_NAME Kanban-PT-10000-LTLCardinality-08
FORMULA_NAME Kanban-PT-10000-LTLCardinality-09
FORMULA_NAME Kanban-PT-10000-LTLCardinality-10
FORMULA_NAME Kanban-PT-10000-LTLCardinality-11
FORMULA_NAME Kanban-PT-10000-LTLCardinality-12
FORMULA_NAME Kanban-PT-10000-LTLCardinality-13
FORMULA_NAME Kanban-PT-10000-LTLCardinality-14
FORMULA_NAME Kanban-PT-10000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716552746954

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=Kanban-PT-10000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 12:12:28] [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 12:12:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:12:28] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-24 12:12:28] [INFO ] Transformed 16 places.
[2024-05-24 12:12:28] [INFO ] Transformed 16 transitions.
[2024-05-24 12:12:28] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Kanban-PT-10000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 9 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-05-24 12:12:28] [INFO ] Computed 5 invariants in 9 ms
[2024-05-24 12:12:28] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-24 12:12:28] [INFO ] Invariant cache hit.
[2024-05-24 12:12:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-24 12:12:28] [INFO ] Invariant cache hit.
[2024-05-24 12:12:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 15 out of 16 places after structural reductions.
[2024-05-24 12:12:29] [INFO ] Flatten gal took : 14 ms
[2024-05-24 12:12:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 12:12:29] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 14 out of 16 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 12:12:29] [INFO ] Invariant cache hit.
[2024-05-24 12:12:29] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:12:29] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:12:29] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 12:12:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:12:29] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 12:12:29] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-24 12:12:29] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 12:12:29] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 60009 steps, including 0 resets, run visited all 1 properties in 52 ms. (steps per millisecond=1154 )
Parikh walk visited 11 properties in 5986 ms.
FORMULA Kanban-PT-10000-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(p0))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
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 3 place count 10 transition count 11
Applied a total of 3 rules in 773 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2024-05-24 12:12:36] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2024-05-24 12:12:36] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 12:12:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 12:12:36] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-24 12:12:36] [INFO ] Invariant cache hit.
[2024-05-24 12:12:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-24 12:12:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:12:36] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-24 12:12:36] [INFO ] Invariant cache hit.
[2024-05-24 12:12:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 875 ms. Remains : 10/16 places, 11/16 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 151 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-10000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-03 finished in 1081 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||X(F((X(p0)&&p1)))))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2024-05-24 12:12:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:12:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 12:12:36] [INFO ] Invariant cache hit.
[2024-05-24 12:12:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-24 12:12:36] [INFO ] Invariant cache hit.
[2024-05-24 12:12:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT s2 s8) (GT 3 s7)), p0:(GT 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 279 ms.
Stack based approach found an accepted trace after 298 steps with 0 reset with depth 299 and stack size 254 in 2 ms.
FORMULA Kanban-PT-10000-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-04 finished in 541 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||F(G(p1))) U p2))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
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 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 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 5 place count 11 transition count 12
Applied a total of 5 rules in 750 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2024-05-24 12:12:38] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2024-05-24 12:12:38] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:12:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 12:12:38] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2024-05-24 12:12:38] [INFO ] Invariant cache hit.
[2024-05-24 12:12:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 12:12:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:12:38] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2024-05-24 12:12:38] [INFO ] Invariant cache hit.
[2024-05-24 12:12:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 852 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 3 s7), p0:(GT 3 s1), p1:(GT s5 s0)], 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 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-05 finished in 957 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 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 6 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
[2024-05-24 12:12:38] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2024-05-24 12:12:38] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:12:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 12:12:38] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:12:38] [INFO ] Invariant cache hit.
[2024-05-24 12:12:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:12:38] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 12:12:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:12:38] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:12:38] [INFO ] Invariant cache hit.
[2024-05-24 12:12:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/16 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 13/16 places, 14/16 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 1 s5) (LEQ s9 s7)), p0:(GT s0 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 253 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 p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 406276 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406276 steps, saw 283406 distinct states, run finished after 3006 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 12:12:42] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:12:42] [INFO ] Invariant cache hit.
[2024-05-24 12:12:42] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:12:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:12:42] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:12:42] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 12:12:42] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 12:12:42] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 14/14 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 11 transition count 10
Applied a total of 6 rules in 4 ms. Remains 11 /13 variables (removed 2) and now considering 10/14 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 11/13 places, 10/14 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 639453 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639453 steps, saw 432122 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 11 cols
[2024-05-24 12:12:51] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 12:12:51] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:12:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:12:51] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:12:51] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 12:12:51] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 80001 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=1379 )
Parikh walk visited 3 properties in 768 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-24 12:12:52] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2024-05-24 12:12:52] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:12:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 12:12:52] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:12:52] [INFO ] Invariant cache hit.
[2024-05-24 12:12:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:12:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 12:12:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:12:52] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:12:52] [INFO ] Invariant cache hit.
[2024-05-24 12:12:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 13/13 places, 14/14 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 416948 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 416948 steps, saw 291029 distinct states, run finished after 3002 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 12:12:56] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-05-24 12:12:56] [INFO ] Invariant cache hit.
[2024-05-24 12:12:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:12:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:12:56] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:12:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:12:56] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 12:12:56] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 12:12:56] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6001 ms.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 14/14 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 11 transition count 10
Applied a total of 6 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 10/14 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 11/13 places, 10/14 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=5000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 379901 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379901 steps, saw 278827 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 11 cols
[2024-05-24 12:13:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:13:05] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:13:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:13:05] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:13:05] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 12:13:05] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 80001 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=1379 )
Parikh walk visited 3 properties in 1032 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Built C files in :
/tmp/ltsmin6951583574524255629
[2024-05-24 12:13:07] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-24 12:13:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:13:07] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-24 12:13:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:13:07] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-24 12:13:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:13:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6951583574524255629
Running compilation step : cd /tmp/ltsmin6951583574524255629;'/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 189 ms.
Running link step : cd /tmp/ltsmin6951583574524255629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6951583574524255629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased822550104810841376.hoa' '--buchi-type=spotba'
LTSmin run took 8769 ms.
FORMULA Kanban-PT-10000-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-10000-LTLCardinality-06 finished in 37947 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(p1)||G(p2)))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2024-05-24 12:13:16] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:13:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 12:13:16] [INFO ] Invariant cache hit.
[2024-05-24 12:13:16] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-24 12:13:16] [INFO ] Invariant cache hit.
[2024-05-24 12:13:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT 1 s3), p2:(OR (GT s12 s2) (LEQ s8 s5)), p1:(GT s5 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8032 reset in 143 ms.
Product exploration explored 100000 steps with 8080 reset in 172 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 (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=5000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:13:17] [INFO ] Invariant cache hit.
[2024-05-24 12:13:17] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:13:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:13:17] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:13:17] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 12:13:17] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120166 steps, including 0 resets, run visited all 1 properties in 129 ms. (steps per millisecond=931 )
Parikh walk visited 1 properties in 128 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-24 12:13:17] [INFO ] Invariant cache hit.
[2024-05-24 12:13:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:13:17] [INFO ] Invariant cache hit.
[2024-05-24 12:13:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 12:13:17] [INFO ] Invariant cache hit.
[2024-05-24 12:13:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 15/15 places, 16/16 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 (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-24 12:13:18] [INFO ] Invariant cache hit.
[2024-05-24 12:13:18] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:13:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:13:18] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:13:18] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 12:13:18] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120712 steps, including 0 resets, run visited all 1 properties in 137 ms. (steps per millisecond=881 )
Parikh walk visited 1 properties in 136 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7907 reset in 104 ms.
Product exploration explored 100000 steps with 7646 reset in 134 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 6 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 12 /15 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2024-05-24 12:13:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:13:19] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2024-05-24 12:13:19] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:13:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/15 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 12/15 places, 13/16 transitions.
Built C files in :
/tmp/ltsmin6654051216518035932
[2024-05-24 12:13:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6654051216518035932
Running compilation step : cd /tmp/ltsmin6654051216518035932;'/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 99 ms.
Running link step : cd /tmp/ltsmin6654051216518035932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6654051216518035932;'/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/stateBased15049869643612973655.hoa' '--buchi-type=spotba'
LTSmin run took 1880 ms.
FORMULA Kanban-PT-10000-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-10000-LTLCardinality-08 finished in 5255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 5 place count 10 transition count 11
Applied a total of 5 rules in 584 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2024-05-24 12:13:22] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2024-05-24 12:13:22] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:13:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 12:13:22] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-24 12:13:22] [INFO ] Invariant cache hit.
[2024-05-24 12:13:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 12:13:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:13:22] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-24 12:13:22] [INFO ] Invariant cache hit.
[2024-05-24 12:13:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 202 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) 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
Finished probabilistic random walk after 273279 steps, run visited all 1 properties in 282 ms. (steps per millisecond=969 )
Probabilistic random walk after 273279 steps, saw 161370 distinct states, run finished after 282 ms. (steps per millisecond=969 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-24 12:13:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-24 12:13:23] [INFO ] Invariant cache hit.
[2024-05-24 12:13:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:13:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-24 12:13:23] [INFO ] Invariant cache hit.
[2024-05-24 12:13:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-24 12:13:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:13:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-24 12:13:23] [INFO ] Invariant cache hit.
[2024-05-24 12:13:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 10/10 places, 11/11 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 273279 steps, run visited all 1 properties in 269 ms. (steps per millisecond=1015 )
Probabilistic random walk after 273279 steps, saw 161370 distinct states, run finished after 269 ms. (steps per millisecond=1015 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Built C files in :
/tmp/ltsmin11865499384640309891
[2024-05-24 12:13:24] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-24 12:13:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:13:24] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-24 12:13:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:13:24] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-24 12:13:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:13:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11865499384640309891
Running compilation step : cd /tmp/ltsmin11865499384640309891;'/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 87 ms.
Running link step : cd /tmp/ltsmin11865499384640309891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11865499384640309891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased58143485902501626.hoa' '--buchi-type=spotba'
LTSmin run took 1260 ms.
FORMULA Kanban-PT-10000-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-10000-LTLCardinality-10 finished in 3982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X((p1||X((G(p2) U (p1&&G(p2))))))))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2024-05-24 12:13:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:13:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:13:25] [INFO ] Invariant cache hit.
[2024-05-24 12:13:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 12:13:25] [INFO ] Invariant cache hit.
[2024-05-24 12:13:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (LEQ s8 s9) (LEQ 1 s11)), p1:(LEQ 3 s0), p2:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 220 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) (NOT p2)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 12:13:27] [INFO ] Invariant cache hit.
[2024-05-24 12:13:27] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 12:13:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:13:27] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 12:13:27] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-24 12:13:27] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 109963 steps, including 0 resets, run visited all 5 properties in 1544 ms. (steps per millisecond=71 )
Parikh walk visited 5 properties in 1544 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p1 (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p2)), (F (AND p0 p2)), (F p2), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND (NOT p0) p2)), (F (AND p1 p0 p2))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-10000-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-10000-LTLCardinality-14 finished in 3423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2024-05-24 12:13:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:13:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:13:29] [INFO ] Invariant cache hit.
[2024-05-24 12:13:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 12:13:29] [INFO ] Invariant cache hit.
[2024-05-24 12:13:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17520 reset in 67 ms.
Stack based approach found an accepted trace after 105 steps with 25 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-15 finished in 271 ms.
All properties solved by simple procedures.
Total runtime 60867 ms.

BK_STOP 1716552810187

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-10000"
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 Kanban-PT-10000, 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 r241-tall-171649628200112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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