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.r476-tall-171620505800419.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 ltsminxred
Input is ClientsAndServers-PT-N0010P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505800419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 23:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 23:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 23:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N0010P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717207055084

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:57:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:57:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:57:36] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-06-01 01:57:36] [INFO ] Transformed 25 places.
[2024-06-01 01:57:36] [INFO ] Transformed 18 transitions.
[2024-06-01 01:57:36] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 01:57:36] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 01:57:36] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 01:57:36] [INFO ] Invariant cache hit.
[2024-06-01 01:57:36] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 50 constraints, problems are : Problem set: 0 solved, 17 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 22 out of 25 places after structural reductions.
[2024-06-01 01:57:37] [INFO ] Flatten gal took : 15 ms
[2024-06-01 01:57:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 01:57:37] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40008 steps (33 resets) in 148 ms. (268 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
[2024-06-01 01:57:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 25/43 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 40ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1&&X(F(p0))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 6 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:57:38] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 01:57:38] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-01
Product exploration explored 100000 steps with 25009 reset in 289 ms.
Product exploration explored 100000 steps with 24992 reset in 113 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 324 steps (0 resets) in 4 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:57:39] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 01:57:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-01 finished in 1637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:57:39] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:57:39] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-03
Product exploration explored 100000 steps with 5 reset in 264 ms.
Stack based approach found an accepted trace after 9735 steps with 0 reset with depth 9736 and stack size 9736 in 21 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-03 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 12 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 01:57:40] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 01:57:40] [INFO ] Implicit Places using invariants in 43 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 01:57:40] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:57:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 01:57:40] [INFO ] Invariant cache hit.
[2024-06-01 01:57:40] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-05
Product exploration explored 100000 steps with 3533 reset in 115 ms.
Stack based approach found an accepted trace after 1001 steps with 30 reset with depth 45 and stack size 45 in 2 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-05 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U (p2&&X(X(p3))))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:57:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:57:40] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-06
Product exploration explored 100000 steps with 8469 reset in 91 ms.
Product exploration explored 100000 steps with 8507 reset in 219 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1 p3), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (AND (NOT p2) p1)), (X (OR (AND p2 p0) (AND p0 p1))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X (OR (AND p2 p0) (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 158 ms. Reduced automaton from 8 states, 36 edges and 4 AP (stutter sensitive) to 8 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 6981 steps (5 resets) in 35 ms. (193 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND (NOT p2) p0 p1 p3), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (AND (NOT p2) p1)), (X (OR (AND p2 p0) (AND p0 p1))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X (OR (AND p2 p0) (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) p3))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT p3)), (F (NOT (OR p2 (NOT p1) p3))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (OR p2 p1 p3))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT p0)), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p0) (NOT p1) p3)))), (F (NOT (OR (NOT p2) (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2) p1 p3))), (F (NOT (AND (OR p0 p3) (OR p2 p1 p3)))), (F (NOT (AND p0 (OR p2 p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT p1))]
Knowledge based reduction with 35 factoid took 1029 ms. Reduced automaton from 8 states, 36 edges and 4 AP (stutter sensitive) to 8 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 01:57:43] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 01:57:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 01:57:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 01:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:57:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 01:57:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 01:57:43] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:57:43] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:57:43] [INFO ] Invariant cache hit.
[2024-06-01 01:57:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 01:57:43] [INFO ] Invariant cache hit.
[2024-06-01 01:57:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:57:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (AND (NOT p2) p1)), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 168 ms. Reduced automaton from 8 states, 36 edges and 4 AP (stutter sensitive) to 8 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 5698 steps (3 resets) in 25 ms. (219 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (AND (NOT p2) p1)), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))))), (X (X p0)), (X (X (AND (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) p3))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT p3)), (F (NOT (OR p2 (NOT p1) p3))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (OR p2 p1 p3))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT p0)), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p0) (NOT p1) p3)))), (F (NOT (OR (NOT p2) (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2) p1 p3))), (F (NOT (AND (OR p0 p3) (OR p2 p1 p3)))), (F (NOT (AND p0 (OR p2 p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT p1))]
Knowledge based reduction with 35 factoid took 1042 ms. Reduced automaton from 8 states, 36 edges and 4 AP (stutter sensitive) to 8 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
[2024-06-01 01:57:46] [INFO ] Invariant cache hit.
[2024-06-01 01:57:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 01:57:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 01:57:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:57:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 01:57:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 01:57:46] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 01:57:46] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 8430 reset in 108 ms.
Product exploration explored 100000 steps with 8470 reset in 104 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:57:47] [INFO ] Invariant cache hit.
[2024-06-01 01:57:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 01:57:47] [INFO ] Invariant cache hit.
[2024-06-01 01:57:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:57:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-06 finished in 7645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&F(p1)))&&G((p2||X((G(p3) U (p2&&G(p3))))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:57:48] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 01:57:48] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), true, (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-08 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:57:48] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 01:57:48] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 54 ms.
Product exploration explored 100000 steps with 33333 reset in 52 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-10 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U (G((p1||G(!p2)))||(p3&&(p1||G(!p2)))))||p0)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 4 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:57:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:57:48] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-11 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1||G(p2))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-06-01 01:57:49] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 01:57:49] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 32 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-12 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 5 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 01:57:49] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:57:49] [INFO ] Implicit Places using invariants in 22 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 01:57:49] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 01:57:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 01:57:49] [INFO ] Invariant cache hit.
[2024-06-01 01:57:49] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-13
Product exploration explored 100000 steps with 996 reset in 93 ms.
Stack based approach found an accepted trace after 106 steps with 0 reset with depth 107 and stack size 107 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-13 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&G(p1)) U (G((p0&&G(p1)))||(p0&&X(!p0)&&G(p1)))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:57:49] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 01:57:49] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-14
Stuttering criterion allowed to conclude after 41162 steps with 0 reset in 65 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-14 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:57:50] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:57:50] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 389 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-15 finished in 124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U (p2&&X(X(p3))))))))'
[2024-06-01 01:57:50] [INFO ] Flatten gal took : 8 ms
[2024-06-01 01:57:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 01:57:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 2 ms.
Total runtime 14050 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717207070604

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ClientsAndServers-PT-N0010P0-LTLCardinality-06
ltl formula formula --ltl=/tmp/1273/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1273/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1273/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1273/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1273/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 26 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 76 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~501!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1194
pnml2lts-mc( 0/ 4): unique states count: 2202
pnml2lts-mc( 0/ 4): unique transitions count: 3790
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 261
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2211
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1017
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2211 states 3813 transitions, fanout: 1.725
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.000 sec minimum, 0.018 sec on average)
pnml2lts-mc( 0/ 4): States per second: 73700, Transitions per second: 127100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 26.1 B/state, compr.: 24.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="ClientsAndServers-PT-N0010P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ClientsAndServers-PT-N0010P0, 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 r476-tall-171620505800419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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