Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620415000367.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K 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 BusinessProcesses-PT-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651509664

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=BusinessProcesses-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:38:31] [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-25 15:38:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:38:31] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-25 15:38:31] [INFO ] Transformed 717 places.
[2024-05-25 15:38:31] [INFO ] Transformed 642 transitions.
[2024-05-25 15:38:31] [INFO ] Found NUPN structural information;
[2024-05-25 15:38:31] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 234 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 4 formulas.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 105 place count 597 transition count 530
Iterating global reduction 1 with 97 rules applied. Total rules applied 202 place count 597 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 597 transition count 529
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 255 place count 545 transition count 477
Iterating global reduction 2 with 52 rules applied. Total rules applied 307 place count 545 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 544 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 544 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 310 place count 543 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 311 place count 543 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 542 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 542 transition count 474
Applied a total of 313 rules in 254 ms. Remains 542 /702 variables (removed 160) and now considering 474/627 (removed 153) transitions.
// Phase 1: matrix 474 rows 542 cols
[2024-05-25 15:38:32] [INFO ] Computed 106 invariants in 28 ms
[2024-05-25 15:38:32] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-25 15:38:32] [INFO ] Invariant cache hit.
[2024-05-25 15:38:33] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2024-05-25 15:38:33] [INFO ] Invariant cache hit.
[2024-05-25 15:38:33] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 542/702 places, 474/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1756 ms. Remains : 542/702 places, 474/627 transitions.
Support contains 22 out of 542 places after structural reductions.
[2024-05-25 15:38:33] [INFO ] Flatten gal took : 68 ms
[2024-05-25 15:38:34] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:38:34] [INFO ] Input system was already deterministic with 474 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 15:38:34] [INFO ] Invariant cache hit.
[2024-05-25 15:38:35] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2024-05-25 15:38:35] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2024-05-25 15:38:35] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 15:38:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2024-05-25 15:38:35] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2024-05-25 15:38:35] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 15:38:35] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 11 ms to minimize.
[2024-05-25 15:38:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 175 ms
[2024-05-25 15:38:35] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:38:36] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:38:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1156 ms
[2024-05-25 15:38:37] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:38:37] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:38:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-25 15:38:37] [INFO ] After 2066ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-25 15:38:37] [INFO ] After 2370ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 51 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 474/474 transitions.
Graph (trivial) has 260 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1204 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 536 transition count 401
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 471 transition count 401
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 132 place count 471 transition count 286
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 387 place count 331 transition count 286
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 393 place count 325 transition count 280
Iterating global reduction 2 with 6 rules applied. Total rules applied 399 place count 325 transition count 280
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 686 place count 180 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 688 place count 179 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 689 place count 179 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 690 place count 178 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 691 place count 177 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 692 place count 176 transition count 139
Applied a total of 692 rules in 84 ms. Remains 176 /542 variables (removed 366) and now considering 139/474 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 176/542 places, 139/474 transitions.
Finished random walk after 7970 steps, including 424 resets, run visited all 1 properties in 28 ms. (steps per millisecond=284 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 486 stabilizing places and 428 stable transitions
Graph (complete) has 1219 edges and 542 vertex of which 541 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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(F(p0)))))'
Support contains 1 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 531 transition count 463
Applied a total of 22 rules in 35 ms. Remains 531 /542 variables (removed 11) and now considering 463/474 (removed 11) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-25 15:38:37] [INFO ] Computed 106 invariants in 10 ms
[2024-05-25 15:38:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-25 15:38:38] [INFO ] Invariant cache hit.
[2024-05-25 15:38:38] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-25 15:38:38] [INFO ] Invariant cache hit.
[2024-05-25 15:38:38] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/542 places, 463/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 531/542 places, 463/474 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 277 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-03 finished in 1292 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((X(p0)&&F((p1||G(p2))))))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 474/474 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 535 transition count 467
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 533 transition count 465
Applied a total of 18 rules in 40 ms. Remains 533 /542 variables (removed 9) and now considering 465/474 (removed 9) transitions.
// Phase 1: matrix 465 rows 533 cols
[2024-05-25 15:38:39] [INFO ] Computed 106 invariants in 8 ms
[2024-05-25 15:38:39] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-25 15:38:39] [INFO ] Invariant cache hit.
[2024-05-25 15:38:39] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-25 15:38:39] [INFO ] Invariant cache hit.
[2024-05-25 15:38:40] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/542 places, 465/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1018 ms. Remains : 533/542 places, 465/474 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s401 0) (EQ s45 1)), p0:(OR (EQ s320 0) (EQ s422 1)), p2:(AND (EQ s57 0) (EQ s401 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 7 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 1231 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 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 474/474 transitions.
Graph (trivial) has 260 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1212 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 535 transition count 400
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 469 transition count 400
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 469 transition count 286
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 330 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 392 place count 325 transition count 281
Iterating global reduction 2 with 5 rules applied. Total rules applied 397 place count 325 transition count 281
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 686 place count 179 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 688 place count 178 transition count 141
Applied a total of 688 rules in 79 ms. Remains 178 /542 variables (removed 364) and now considering 141/474 (removed 333) transitions.
// Phase 1: matrix 141 rows 178 cols
[2024-05-25 15:38:40] [INFO ] Computed 78 invariants in 2 ms
[2024-05-25 15:38:40] [INFO ] Implicit Places using invariants in 129 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 132 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/542 places, 141/474 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 150/542 places, 141/474 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s104 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13588 reset in 298 ms.
Stack based approach found an accepted trace after 12729 steps with 1791 reset with depth 18 and stack size 15 in 76 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-08 finished in 650 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 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 474/474 transitions.
Graph (trivial) has 261 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1212 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 535 transition count 401
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 470 transition count 401
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 132 place count 470 transition count 286
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 387 place count 330 transition count 286
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 394 place count 323 transition count 279
Iterating global reduction 2 with 7 rules applied. Total rules applied 401 place count 323 transition count 279
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 684 place count 180 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 686 place count 179 transition count 142
Applied a total of 686 rules in 72 ms. Remains 179 /542 variables (removed 363) and now considering 142/474 (removed 332) transitions.
// Phase 1: matrix 142 rows 179 cols
[2024-05-25 15:38:41] [INFO ] Computed 78 invariants in 2 ms
[2024-05-25 15:38:41] [INFO ] Implicit Places using invariants in 488 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 504 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/542 places, 142/474 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 584 ms. Remains : 151/542 places, 142/474 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-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:(OR (EQ s4 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11430 reset in 254 ms.
Product exploration explored 100000 steps with 11277 reset in 230 ms.
Computed a total of 129 stabilizing places and 125 stable transitions
Computed a total of 129 stabilizing places and 125 stable transitions
Detected a total of 129/151 stabilizing places and 125/142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1319 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 598 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 556 steps, run visited all 1 properties in 15 ms. (steps per millisecond=37 )
Probabilistic random walk after 556 steps, saw 215 distinct states, run finished after 15 ms. (steps per millisecond=37 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 142/142 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 151 cols
[2024-05-25 15:38:42] [INFO ] Computed 50 invariants in 2 ms
[2024-05-25 15:38:42] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-25 15:38:42] [INFO ] Invariant cache hit.
[2024-05-25 15:38:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:38:42] [INFO ] Implicit Places using invariants and state equation in 212 ms returned [3, 36, 37, 52, 54, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 321 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/151 places, 142/142 transitions.
Graph (complete) has 419 edges and 127 vertex of which 120 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 120 transition count 127
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 108 transition count 127
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 97 transition count 94
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 97 transition count 94
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 97 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 94 transition count 91
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 91 transition count 88
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 91 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 91 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 71 place count 86 transition count 81
Applied a total of 71 rules in 32 ms. Remains 86 /127 variables (removed 41) and now considering 81/142 (removed 61) transitions.
// Phase 1: matrix 81 rows 86 cols
[2024-05-25 15:38:42] [INFO ] Computed 23 invariants in 0 ms
[2024-05-25 15:38:43] [INFO ] Implicit Places using invariants in 69 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/151 places, 81/142 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 450 ms. Remains : 85/151 places, 81/142 transitions.
Computed a total of 63 stabilizing places and 64 stable transitions
Graph (complete) has 282 edges and 85 vertex of which 82 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 63 stabilizing places and 64 stable transitions
Detected a total of 63/85 stabilizing places and 64/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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)]
Incomplete random walk after 10000 steps, including 1333 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 574 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 223 steps, run visited all 1 properties in 15 ms. (steps per millisecond=14 )
Probabilistic random walk after 223 steps, saw 97 distinct states, run finished after 15 ms. (steps per millisecond=14 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 132 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11431 reset in 156 ms.
Product exploration explored 100000 steps with 11456 reset in 206 ms.
Built C files in :
/tmp/ltsmin16254054687701561614
[2024-05-25 15:38:43] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-25 15:38:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:38:43] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-25 15:38:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:38:43] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-25 15:38:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:38:43] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16254054687701561614
Running compilation step : cd /tmp/ltsmin16254054687701561614;'/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 300 ms.
Running link step : cd /tmp/ltsmin16254054687701561614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16254054687701561614;'/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/stateBased11376021355909996145.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLCardinality-10 finished in 3537 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 (G(p0)||(p0&&G(!p1)))))'
Support contains 3 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 474/474 transitions.
Graph (trivial) has 259 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1212 edges and 537 vertex of which 536 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 535 transition count 401
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 470 transition count 401
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 132 place count 470 transition count 287
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 384 place count 332 transition count 287
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 326 transition count 281
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 326 transition count 281
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 285 rules applied. Total rules applied 681 place count 182 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 683 place count 181 transition count 143
Applied a total of 683 rules in 62 ms. Remains 181 /542 variables (removed 361) and now considering 143/474 (removed 331) transitions.
// Phase 1: matrix 143 rows 181 cols
[2024-05-25 15:38:44] [INFO ] Computed 79 invariants in 2 ms
[2024-05-25 15:38:44] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 145 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/542 places, 143/474 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 152/542 places, 143/474 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s128 1), p1:(OR (EQ s128 1) (EQ s8 0) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 785 steps with 106 reset in 6 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-12 finished in 444 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((G((p1 U p2))||p0)))))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 474/474 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 535 transition count 467
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 534 transition count 466
Applied a total of 16 rules in 39 ms. Remains 534 /542 variables (removed 8) and now considering 466/474 (removed 8) transitions.
// Phase 1: matrix 466 rows 534 cols
[2024-05-25 15:38:45] [INFO ] Computed 106 invariants in 4 ms
[2024-05-25 15:38:45] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 15:38:45] [INFO ] Invariant cache hit.
[2024-05-25 15:38:45] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-05-25 15:38:45] [INFO ] Invariant cache hit.
[2024-05-25 15:38:46] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/542 places, 466/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 534/542 places, 466/474 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s339 0) (EQ s283 1)), p2:(OR (EQ s412 0) (EQ s176 1)), p1:(EQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 375 ms.
Product exploration explored 100000 steps with 33333 reset in 377 ms.
Computed a total of 479 stabilizing places and 421 stable transitions
Graph (complete) has 1205 edges and 534 vertex of which 533 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 479 stabilizing places and 421 stable transitions
Detected a total of 479/534 stabilizing places and 421/466 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 431 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLCardinality-14 finished in 2401 ms.
All properties solved by simple procedures.
Total runtime 15836 ms.

BK_STOP 1716651527559

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-18"
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 BusinessProcesses-PT-18, 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 r065-tajo-171620415000367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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