About the Execution of ITS-Tools for SafeBus-COL-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
489.747 | 40961.00 | 67808.00 | 274.10 | FTFFTFFTTFFFFFTF | normal |
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.r334-tall-171679080100355.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 itstools
Input is SafeBus-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080100355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.9K Apr 12 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-COL-03-LTLCardinality-00
FORMULA_NAME SafeBus-COL-03-LTLCardinality-01
FORMULA_NAME SafeBus-COL-03-LTLCardinality-02
FORMULA_NAME SafeBus-COL-03-LTLCardinality-03
FORMULA_NAME SafeBus-COL-03-LTLCardinality-04
FORMULA_NAME SafeBus-COL-03-LTLCardinality-05
FORMULA_NAME SafeBus-COL-03-LTLCardinality-06
FORMULA_NAME SafeBus-COL-03-LTLCardinality-07
FORMULA_NAME SafeBus-COL-03-LTLCardinality-08
FORMULA_NAME SafeBus-COL-03-LTLCardinality-09
FORMULA_NAME SafeBus-COL-03-LTLCardinality-10
FORMULA_NAME SafeBus-COL-03-LTLCardinality-11
FORMULA_NAME SafeBus-COL-03-LTLCardinality-12
FORMULA_NAME SafeBus-COL-03-LTLCardinality-13
FORMULA_NAME SafeBus-COL-03-LTLCardinality-14
FORMULA_NAME SafeBus-COL-03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716820062193
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-27 14:27:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 14:27:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:27:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 14:27:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 14:27:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 536 ms
[2024-05-27 14:27:43] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2024-05-27 14:27:43] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 14:27:44] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 14:27:44] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA SafeBus-COL-03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-COL-03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (8 resets) in 1374 ms. (29 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40002 steps (8 resets) in 405 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 14:27:45] [INFO ] Computed 7 invariants in 6 ms
[2024-05-27 14:27:45] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-27 14:27:45] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 9 ms to minimize.
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 17/31 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 284ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
[2024-05-27 14:27:45] [INFO ] Flatten gal took : 14 ms
[2024-05-27 14:27:45] [INFO ] Flatten gal took : 3 ms
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2024-05-27 14:27:45] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 14 ms.
[2024-05-27 14:27:45] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Support contains 42 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-27 14:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:27:45] [INFO ] Computed 17 invariants in 9 ms
[2024-05-27 14:27:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 14:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 14:27:45] [INFO ] Invariant cache hit.
[2024-05-27 14:27:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:27:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-27 14:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-05-27 14:27:45] [INFO ] Invariant cache hit.
[2024-05-27 14:27:45] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:27:45] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 4 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-27 14:27:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 98 constraints, problems are : Problem set: 9 solved, 79 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 14/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:27:47] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/32 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/86 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/99 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/178 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:27:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/179 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-05-27 14:27:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 180 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 17/17 constraints]
After SMT, in 5291ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 5294ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5462 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 42 out of 54 places after structural reductions.
[2024-05-27 14:27:50] [INFO ] Flatten gal took : 16 ms
[2024-05-27 14:27:51] [INFO ] Flatten gal took : 11 ms
[2024-05-27 14:27:51] [INFO ] Input system was already deterministic with 82 transitions.
RANDOM walk for 40000 steps (8 resets) in 1018 ms. (39 steps per ms) remains 4/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
[2024-05-27 14:27:51] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:51] [INFO ] Invariant cache hit.
[2024-05-27 14:27:51] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/29 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 3 (OVERLAPS) 23/52 variables, 10/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-27 14:27:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-27 14:27:51] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 52/122 variables, and 17 constraints, problems are : Problem set: 4 solved, 0 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/54 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 109ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SafeBus-COL-03-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
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' '!(X(G(p0)))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:27:51] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:51] [INFO ] Invariant cache hit.
[2024-05-27 14:27:51] [INFO ] Implicit Places using invariants in 67 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA SafeBus-COL-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-03-LTLCardinality-00 finished in 318 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(F((p0||X(X(F(p1))))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:27:52] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:52] [INFO ] Invariant cache hit.
[2024-05-27 14:27:52] [INFO ] Implicit Places using invariants in 387 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 389 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-03
Product exploration explored 100000 steps with 13128 reset in 372 ms.
Product exploration explored 100000 steps with 13137 reset in 203 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) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 73 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 14:27:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 51 cols
[2024-05-27 14:27:54] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 14:27:54] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-27 14:27:54] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-27 14:27:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 14:27:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:27:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-27 14:27:54] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 14:27:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-27 14:27:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:27:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-27 14:27:54] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-27 14:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-27 14:27:54] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 9 ms.
[2024-05-27 14:27:54] [INFO ] Added : 34 causal constraints over 7 iterations in 71 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:27:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:54] [INFO ] Invariant cache hit.
[2024-05-27 14:27:54] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-27 14:27:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:54] [INFO ] Invariant cache hit.
[2024-05-27 14:27:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:27:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-27 14:27:54] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:54] [INFO ] Invariant cache hit.
[2024-05-27 14:27:54] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:27:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-27 14:27:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-27 14:27:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-27 14:27:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:27:56] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-27 14:27:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 68/119 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 98 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2528 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 68/119 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 20/20 constraints]
After SMT, in 4111ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4113ms
Finished structural reductions in LTL mode , in 1 iterations and 4268 ms. Remains : 51/51 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 14:27:59] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:27:59] [INFO ] Invariant cache hit.
[2024-05-27 14:27:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-27 14:27:59] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 14:27:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 14:27:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:27:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-27 14:27:59] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 14:27:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 14:27:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:27:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-27 14:27:59] [INFO ] Computed and/alt/rep : 52/255/52 causal constraints (skipped 13 transitions) in 4 ms.
[2024-05-27 14:27:59] [INFO ] Added : 28 causal constraints over 6 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13140 reset in 107 ms.
Product exploration explored 100000 steps with 13145 reset in 222 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 82/82 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 91
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 3 rules in 17 ms. Remains 51 /51 variables (removed 0) and now considering 91/82 (removed -9) transitions.
[2024-05-27 14:28:00] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-27 14:28:00] [INFO ] Flow matrix only has 77 transitions (discarded 14 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-27 14:28:00] [INFO ] Computed 14 invariants in 8 ms
[2024-05-27 14:28:00] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-27 14:28:00] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-27 14:28:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-27 14:28:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 19/33 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 77/128 variables, 51/84 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 13/97 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/97 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/97 constraints. Problems are: Problem set: 6 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 97 constraints, problems are : Problem set: 6 solved, 82 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 6 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 19/23 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/50 variables, 2/25 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 3/28 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 1/51 variables, 5/33 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 77/128 variables, 51/84 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 13/97 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 82/179 constraints. Problems are: Problem set: 6 solved, 82 unsolved
[2024-05-27 14:28:03] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 1/180 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/180 constraints. Problems are: Problem set: 6 solved, 82 unsolved
[2024-05-27 14:28:04] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-27 14:28:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/128 variables, 2/182 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 0/182 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 16 (OVERLAPS) 0/128 variables, 0/182 constraints. Problems are: Problem set: 6 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 182 constraints, problems are : Problem set: 6 solved, 82 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/88 constraints, Known Traps: 22/22 constraints]
After SMT, in 5584ms problems are : Problem set: 6 solved, 82 unsolved
Search for dead transitions found 6 dead transitions in 5587ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 85/82 transitions.
Graph (complete) has 343 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 48 /51 variables (removed 3) and now considering 85/85 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/51 places, 85/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5620 ms. Remains : 48/51 places, 85/82 transitions.
Built C files in :
/tmp/ltsmin1063566458349410044
[2024-05-27 14:28:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1063566458349410044
Running compilation step : cd /tmp/ltsmin1063566458349410044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin1063566458349410044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1063566458349410044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1786232354430680686.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA SafeBus-COL-03-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-COL-03-LTLCardinality-03 finished in 14750 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((p0||G(F(p1))||F(p2))))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:06] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:28:06] [INFO ] Computed 17 invariants in 1 ms
[2024-05-27 14:28:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-27 14:28:07] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:07] [INFO ] Invariant cache hit.
[2024-05-27 14:28:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:28:07] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-27 14:28:07] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:07] [INFO ] Invariant cache hit.
[2024-05-27 14:28:07] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-27 14:28:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:08] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-27 14:28:08] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints]
After SMT, in 3359ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3360ms
Finished structural reductions in LTL mode , in 1 iterations and 3483 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-03-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-03-LTLCardinality-04 finished in 3856 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||G(p2))))))'
Support contains 19 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:10] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:10] [INFO ] Invariant cache hit.
[2024-05-27 14:28:10] [INFO ] Implicit Places using invariants in 46 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 1 ms.
FORMULA SafeBus-COL-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-03-LTLCardinality-05 finished in 381 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(p0) U p1)&&(X(F(p2)) U G(p0))))'
Support contains 17 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:11] [INFO ] Invariant cache hit.
[2024-05-27 14:28:11] [INFO ] Implicit Places using invariants in 46 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-06
Product exploration explored 100000 steps with 9484 reset in 149 ms.
Stack based approach found an accepted trace after 77821 steps with 7286 reset with depth 39 and stack size 39 in 160 ms.
FORMULA SafeBus-COL-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-03-LTLCardinality-06 finished in 733 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((G(p1)||p0))))'
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:11] [INFO ] Invariant cache hit.
[2024-05-27 14:28:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-27 14:28:11] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:11] [INFO ] Invariant cache hit.
[2024-05-27 14:28:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:28:12] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-27 14:28:12] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 14:28:12] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:12] [INFO ] Invariant cache hit.
[2024-05-27 14:28:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-27 14:28:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:13] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-27 14:28:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints]
After SMT, in 3357ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3496 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-07
Product exploration explored 100000 steps with 5087 reset in 148 ms.
Product exploration explored 100000 steps with 5093 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 46 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 349 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:16] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:16] [INFO ] Invariant cache hit.
[2024-05-27 14:28:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-27 14:28:16] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:16] [INFO ] Invariant cache hit.
[2024-05-27 14:28:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:28:16] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-27 14:28:16] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-27 14:28:16] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:16] [INFO ] Invariant cache hit.
[2024-05-27 14:28:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:16] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-27 14:28:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-27 14:28:18] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-27 14:28:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1661 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints]
After SMT, in 3369ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3370ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3515 ms. Remains : 54/54 places, 82/82 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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5022 reset in 146 ms.
Product exploration explored 100000 steps with 5111 reset in 152 ms.
Built C files in :
/tmp/ltsmin2234509023497961025
[2024-05-27 14:28:21] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-27 14:28:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 14:28:21] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-27 14:28:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 14:28:21] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-27 14:28:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 14:28:21] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2234509023497961025
Running compilation step : cd /tmp/ltsmin2234509023497961025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin2234509023497961025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2234509023497961025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased374396790131061338.hoa' '--buchi-type=spotba'
LTSmin run took 317 ms.
FORMULA SafeBus-COL-03-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-COL-03-LTLCardinality-07 finished in 9914 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(p0))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:21] [INFO ] Invariant cache hit.
[2024-05-27 14:28:21] [INFO ] Implicit Places using invariants in 53 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 8 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-05-27 14:28:21] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 14:28:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-27 14:28:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:21] [INFO ] Invariant cache hit.
[2024-05-27 14:28:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/54 places, 82/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 45/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-03-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-03-LTLCardinality-08 finished in 527 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 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:28:22] [INFO ] Computed 17 invariants in 3 ms
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants in 57 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 82
Applied a total of 12 rules in 6 ms. Remains 45 /51 variables (removed 6) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-05-27 14:28:22] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:22] [INFO ] Invariant cache hit.
[2024-05-27 14:28:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/54 places, 82/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 45/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-11
Product exploration explored 100000 steps with 12289 reset in 119 ms.
Stack based approach found an accepted trace after 245 steps with 28 reset with depth 36 and stack size 36 in 1 ms.
FORMULA SafeBus-COL-03-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-03-LTLCardinality-11 finished in 382 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(p0))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-05-27 14:28:22] [INFO ] Computed 17 invariants in 1 ms
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants in 50 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-03-LTLCardinality-12 finished in 148 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(p0))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-05-27 14:28:22] [INFO ] Invariant cache hit.
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants in 44 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Applied a total of 6 rules in 4 ms. Remains 48 /51 variables (removed 3) and now considering 79/82 (removed 3) transitions.
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
// Phase 1: matrix 65 rows 48 cols
[2024-05-27 14:28:22] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 14:28:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 14:28:22] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
[2024-05-27 14:28:22] [INFO ] Invariant cache hit.
[2024-05-27 14:28:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 14:28:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/54 places, 79/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 48/54 places, 79/82 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : SafeBus-COL-03-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-03-LTLCardinality-13 finished in 214 ms.
All properties solved by simple procedures.
Total runtime 39869 ms.
BK_STOP 1716820103154
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SafeBus-COL-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SafeBus-COL-03, 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 r334-tall-171679080100355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 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 '
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 ;