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.r439-smll-171690585300002.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 TCPcondis-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585300002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 03:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 03:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 24K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716982478548

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=TCPcondis-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 11:34:42] [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-29 11:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:34:42] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-05-29 11:34:42] [WARNING] Unknown XML tag in source file: size
[2024-05-29 11:34:42] [WARNING] Unknown XML tag in source file: color
[2024-05-29 11:34:42] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-29 11:34:42] [INFO ] Transformed 30 places.
[2024-05-29 11:34:42] [INFO ] Transformed 32 transitions.
[2024-05-29 11:34:42] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Support contains 27 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 21 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:42] [INFO ] Computed 9 invariants in 9 ms
[2024-05-29 11:34:42] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-29 11:34:42] [INFO ] Invariant cache hit.
[2024-05-29 11:34:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-29 11:34:43] [INFO ] Invariant cache hit.
[2024-05-29 11:34:43] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 27 out of 30 places after structural reductions.
[2024-05-29 11:34:43] [INFO ] Flatten gal took : 40 ms
[2024-05-29 11:34:43] [INFO ] Flatten gal took : 16 ms
[2024-05-29 11:34:43] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 1849 steps, including 0 resets, run visited all 34 properties in 94 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-02 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' '!((p0 U G(((p1 U (p2||G(p1)))&&F((p3 U (p4||G(p3))))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 28 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 11:34:44] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 11:34:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 11:34:44] [INFO ] Invariant cache hit.
[2024-05-29 11:34:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 11:34:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:44] [INFO ] Invariant cache hit.
[2024-05-29 11:34:44] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 260 ms. Remains : 25/30 places, 25/32 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 762 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p4) (NOT p3)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p0)) (AND p1 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=0 dest: 5}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p2 (NOT p4)) (AND p1 (NOT p4))), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GT s2 s4) (GT 1 s17)), p0:(GT s14 s6), p1:(GT 1 s17), p4:(AND (GT 3 s3) (GT 2 s16)), p3:(GT 2 s16)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 4 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-00 finished in 1140 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)||F(p1)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 31
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 28 transition count 30
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 28 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 28 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 16 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-29 11:34:45] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 11:34:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 11:34:45] [INFO ] Invariant cache hit.
[2024-05-29 11:34:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-29 11:34:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:45] [INFO ] Invariant cache hit.
[2024-05-29 11:34:45] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LEQ 3 s18) (GT s17 s6)), p0:(LEQ s4 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8034 reset in 595 ms.
Stack based approach found an accepted trace after 5324 steps with 404 reset with depth 19 and stack size 19 in 15 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-01 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:34:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 11:34:46] [INFO ] Invariant cache hit.
[2024-05-29 11:34:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 11:34:46] [INFO ] Invariant cache hit.
[2024-05-29 11:34:46] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ 1 s9), p1:(LEQ s9 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-03 finished in 337 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)||F((p1&&F(p0)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
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 26
Applied a total of 11 rules in 10 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2024-05-29 11:34:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:34:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 11:34:46] [INFO ] Invariant cache hit.
[2024-05-29 11:34:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-29 11:34:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:46] [INFO ] Invariant cache hit.
[2024-05-29 11:34:47] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s8 s18), p1:(LEQ 3 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 100 reset in 385 ms.
Stack based approach found an accepted trace after 317 steps with 0 reset with depth 318 and stack size 318 in 5 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-04 finished in 754 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(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:47] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:34:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 11:34:47] [INFO ] Invariant cache hit.
[2024-05-29 11:34:47] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-29 11:34:47] [INFO ] Invariant cache hit.
[2024-05-29 11:34:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s25)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-05 finished in 329 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((G(F(p0)) U p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 7 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-29 11:34:47] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 11:34:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 11:34:48] [INFO ] Invariant cache hit.
[2024-05-29 11:34:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-29 11:34:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:48] [INFO ] Invariant cache hit.
[2024-05-29 11:34:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} 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 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s11), p0:(LEQ s12 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1450 reset in 292 ms.
Product exploration explored 100000 steps with 1409 reset in 706 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 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 275 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-29 11:34:50] [INFO ] Invariant cache hit.
[2024-05-29 11:34:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 11:34:50] [INFO ] Invariant cache hit.
[2024-05-29 11:34:50] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-29 11:34:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:50] [INFO ] Invariant cache hit.
[2024-05-29 11:34:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 26/26 places, 26/26 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 p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 149 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 43 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 275 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1454 reset in 279 ms.
Product exploration explored 100000 steps with 1488 reset in 310 ms.
Built C files in :
/tmp/ltsmin2795738208511328696
[2024-05-29 11:34:52] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2024-05-29 11:34:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:34:52] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2024-05-29 11:34:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:34:52] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2024-05-29 11:34:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:34:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2795738208511328696
Running compilation step : cd /tmp/ltsmin2795738208511328696;'/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 455 ms.
Running link step : cd /tmp/ltsmin2795738208511328696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin2795738208511328696;'/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/stateBased12351259162204584089.hoa' '--buchi-type=spotba'
LTSmin run took 360 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-05-LTLCardinality-06 finished in 5719 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((X(p0)||G(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:53] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:34:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 11:34:53] [INFO ] Invariant cache hit.
[2024-05-29 11:34:53] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-29 11:34:53] [INFO ] Invariant cache hit.
[2024-05-29 11:34:53] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 1 s28), p0:(GT s20 s21)], 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 3074 reset in 298 ms.
Stack based approach found an accepted trace after 70407 steps with 2224 reset with depth 46 and stack size 46 in 238 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-07 finished in 964 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((G(X((X(p0)&&G(p1)))) U p2)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:34:54] [INFO ] Invariant cache hit.
[2024-05-29 11:34:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 11:34:54] [INFO ] Invariant cache hit.
[2024-05-29 11:34:54] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 11:34:54] [INFO ] Invariant cache hit.
[2024-05-29 11:34:54] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (OR (AND (NOT p1) p0) (AND p1 (NOT p0)))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (LEQ s5 s1) (LEQ s10 s15)), p1:(LEQ s10 s15), p0:(LEQ s5 s1)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-08 finished in 502 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)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:34:55] [INFO ] Invariant cache hit.
[2024-05-29 11:34:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 11:34:55] [INFO ] Invariant cache hit.
[2024-05-29 11:34:55] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-29 11:34:55] [INFO ] Invariant cache hit.
[2024-05-29 11:34:55] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s11 s16)], 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][false, false]]
Product exploration explored 100000 steps with 10919 reset in 194 ms.
Product exploration explored 100000 steps with 10985 reset in 244 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-29 11:34:56] [INFO ] Invariant cache hit.
[2024-05-29 11:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 11:34:56] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 11:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:34:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-29 11:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 11:34:56] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-29 11:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:34:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-29 11:34:56] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 11:34:56] [INFO ] Added : 4 causal constraints over 2 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
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 16 place count 23 transition count 23
Applied a total of 16 rules in 7 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 11:34:56] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:34:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 11:34:56] [INFO ] Invariant cache hit.
[2024-05-29 11:34:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 11:34:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:56] [INFO ] Invariant cache hit.
[2024-05-29 11:34:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 23/30 places, 23/32 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-05-29 11:34:57] [INFO ] Invariant cache hit.
[2024-05-29 11:34:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 11:34:57] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-29 11:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:34:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-29 11:34:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:34:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 11:34:57] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-29 11:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:34:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-29 11:34:57] [INFO ] Computed and/alt/rep : 21/75/21 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:34:57] [INFO ] Added : 18 causal constraints over 5 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19367 reset in 160 ms.
Product exploration explored 100000 steps with 19395 reset in 189 ms.
Built C files in :
/tmp/ltsmin5635427405293678309
[2024-05-29 11:34:57] [INFO ] Computing symmetric may disable matrix : 23 transitions.
[2024-05-29 11:34:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:34:57] [INFO ] Computing symmetric may enable matrix : 23 transitions.
[2024-05-29 11:34:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:34:57] [INFO ] Computing Do-Not-Accords matrix : 23 transitions.
[2024-05-29 11:34:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:34:57] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5635427405293678309
Running compilation step : cd /tmp/ltsmin5635427405293678309;'/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 212 ms.
Running link step : cd /tmp/ltsmin5635427405293678309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5635427405293678309;'/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/stateBased802670052116152663.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-05-LTLCardinality-09 finished in 3223 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)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:58] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:34:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 11:34:58] [INFO ] Invariant cache hit.
[2024-05-29 11:34:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-29 11:34:58] [INFO ] Invariant cache hit.
[2024-05-29 11:34:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 1 s27) (GT s5 s22))], 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][false, false]]
Product exploration explored 100000 steps with 2677 reset in 265 ms.
Stack based approach found an accepted trace after 11582 steps with 311 reset with depth 17 and stack size 17 in 33 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-10 finished in 629 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)||G((!p0&&X(p1))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
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 13 place count 24 transition count 25
Applied a total of 13 rules in 11 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2024-05-29 11:34:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:34:59] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 11:34:59] [INFO ] Invariant cache hit.
[2024-05-29 11:34:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-29 11:34:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:34:59] [INFO ] Invariant cache hit.
[2024-05-29 11:34:59] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s7 s20), p1:(GT s21 s13)], nbAcceptance=2, 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 309 ms.
Stack based approach found an accepted trace after 307 steps with 0 reset with depth 308 and stack size 307 in 2 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-11 finished in 594 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)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:34:59] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:34:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 11:34:59] [INFO ] Invariant cache hit.
[2024-05-29 11:34:59] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 11:34:59] [INFO ] Invariant cache hit.
[2024-05-29 11:34:59] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s4)], 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][false, false]]
Product exploration explored 100000 steps with 587 reset in 268 ms.
Stack based approach found an accepted trace after 1820 steps with 7 reset with depth 588 and stack size 588 in 5 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-12 finished in 658 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 p1) U G((p2&&X(X(G(p0)))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:35:00] [INFO ] Invariant cache hit.
[2024-05-29 11:35:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 11:35:00] [INFO ] Invariant cache hit.
[2024-05-29 11:35:00] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-29 11:35:00] [INFO ] Invariant cache hit.
[2024-05-29 11:35:00] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 670 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p0), (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0, 1} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 8}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 8}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={1} source=6 dest: 9}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=6 dest: 9}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0, 1} source=6 dest: 11}], [{ cond=(NOT p0), acceptance={} source=7 dest: 1}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={1} source=9 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=9 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 8}, { cond=(AND p2 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={0} source=9 dest: 9}, { cond=(AND p2 p0), acceptance={0} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 1}, { cond=p2, acceptance={} source=10 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p2 p0), acceptance={} source=10 dest: 10}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=11 dest: 8}, { cond=(AND p2 p0), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={0} source=11 dest: 9}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=11 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=11 dest: 9}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p2 p0), acceptance={0} source=11 dest: 11}, { cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=11 dest: 11}]], initial=0, aps=[p2:(GT 3 s7), p1:(LEQ 2 s29), p0:(LEQ s25 s29)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-13 finished in 900 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(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 10 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 11:35:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:35:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 11:35:01] [INFO ] Invariant cache hit.
[2024-05-29 11:35:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-29 11:35:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:35:01] [INFO ] Invariant cache hit.
[2024-05-29 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-14 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s13 s24), p1:(LEQ s5 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4477 reset in 241 ms.
Stack based approach found an accepted trace after 74374 steps with 3308 reset with depth 27 and stack size 27 in 193 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-14 finished in 743 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||F((G(p1)||G(F(p2))))) U p3)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 28 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 28 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 9 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-29 11:35:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:35:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 11:35:01] [INFO ] Invariant cache hit.
[2024-05-29 11:35:02] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-29 11:35:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:35:02] [INFO ] Invariant cache hit.
[2024-05-29 11:35:02] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 2 s8), p0:(LEQ s21 s4), p1:(LEQ 1 s16), p2:(GT s17 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1377 reset in 344 ms.
Stack based approach found an accepted trace after 887 steps with 11 reset with depth 46 and stack size 46 in 4 ms.
FORMULA TCPcondis-PT-05-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLCardinality-15 finished in 847 ms.
All properties solved by simple procedures.
Total runtime 20646 ms.

BK_STOP 1716982503778

--------------------
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="TCPcondis-PT-05"
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 TCPcondis-PT-05, 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 r439-smll-171690585300002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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