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.r268-smll-171654406900116.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 PermAdmissibility-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406900116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Apr 12 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 09:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 09:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 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 54K 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 PermAdmissibility-COL-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716673730928

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-25 21:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:48:53] [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-25 21:48:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:48:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1116 ms
[2024-05-25 21:48:54] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 21:48:55] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 9 ms.
[2024-05-25 21:48:55] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 16 properties that can be checked using skeleton over-approximation.
FORMULA PermAdmissibility-COL-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 20 to 16
RANDOM walk for 16844 steps (346 resets) in 527 ms. (31 steps per ms) remains 0/16 properties
[2024-05-25 21:48:55] [INFO ] Flatten gal took : 38 ms
[2024-05-25 21:48:55] [INFO ] Flatten gal took : 13 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-05-25 21:48:55] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 26 ms.
[2024-05-25 21:48:55] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 30 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 31 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-25 21:48:55] [INFO ] Computed 16 invariants in 14 ms
[2024-05-25 21:48:56] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-25 21:48:56] [INFO ] Invariant cache hit.
[2024-05-25 21:48:56] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-25 21:48:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 563 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 15 unsolved in 499 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1137ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1612 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 30 out of 32 places after structural reductions.
[2024-05-25 21:48:57] [INFO ] Flatten gal took : 12 ms
[2024-05-25 21:48:57] [INFO ] Flatten gal took : 9 ms
[2024-05-25 21:48:57] [INFO ] Input system was already deterministic with 16 transitions.
Reduction of identical properties reduced properties to check from 20 to 16
RANDOM walk for 13701 steps (282 resets) in 191 ms. (71 steps per ms) remains 0/16 properties
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 6 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:48:58] [INFO ] Computed 14 invariants in 2 ms
[2024-05-25 21:48:58] [INFO ] Implicit Places using invariants in 71 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 24, 26]
[2024-05-25 21:48:58] [INFO ] Actually due to overlaps returned [3, 11, 13, 18, 19, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 78 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 403 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-00 finished in 573 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((p1||(F(p1)&&X(X(F(p2))))))&&p0)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:48:58] [INFO ] Invariant cache hit.
[2024-05-25 21:48:58] [INFO ] Implicit Places using invariants in 90 ms returned [6, 7, 11, 15, 18, 19, 20, 24, 25, 26]
[2024-05-25 21:48:58] [INFO ] Actually due to overlaps returned [6, 11, 18, 19, 20, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 92 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-01
Stuttering criterion allowed to conclude after 107 steps with 3 reset in 5 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-01 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1||X(G(p2)))&&p0))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:48:59] [INFO ] Computed 15 invariants in 5 ms
[2024-05-25 21:48:59] [INFO ] Implicit Places using invariants in 108 ms returned [3, 5, 6, 7, 13, 14, 19, 21, 26]
[2024-05-25 21:48:59] [INFO ] Actually due to overlaps returned [3, 6, 13, 19, 21]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 118 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 26/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-02
Stuttering criterion allowed to conclude after 39 steps with 1 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-02 finished in 338 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||G(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 7 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:48:59] [INFO ] Computed 14 invariants in 2 ms
[2024-05-25 21:48:59] [INFO ] Implicit Places using invariants in 106 ms returned [3, 5, 13, 14, 18, 19, 20, 24, 25, 26]
[2024-05-25 21:48:59] [INFO ] Actually due to overlaps returned [3, 13, 18, 19, 20, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 109 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 15
Applied a total of 2 rules in 8 ms. Remains 23 /24 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-25 21:48:59] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 21:48:59] [INFO ] Implicit Places using invariants in 54 ms returned [4, 12, 18, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/32 places, 15/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 14 transition count 10
Applied a total of 10 rules in 13 ms. Remains 14 /19 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-25 21:48:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 21:48:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 21:48:59] [INFO ] Invariant cache hit.
[2024-05-25 21:48:59] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 14/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 290 ms. Remains : 14/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-03
Product exploration explored 100000 steps with 7217 reset in 493 ms.
Product exploration explored 100000 steps with 7199 reset in 352 ms.
Computed a total of 14 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 301 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 88 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 644 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 21:49:01] [INFO ] Invariant cache hit.
[2024-05-25 21:49:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:49:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:49:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:49:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:49:02] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:49:02] [INFO ] Added : 6 causal constraints over 2 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-25 21:49:02] [INFO ] Invariant cache hit.
[2024-05-25 21:49:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 21:49:02] [INFO ] Invariant cache hit.
[2024-05-25 21:49:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-25 21:49:02] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-25 21:49:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/23 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/24 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 202 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/23 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 221 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 434ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 14/14 places, 10/10 transitions.
Computed a total of 14 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 363 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 88 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 643 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 21:49:03] [INFO ] Invariant cache hit.
[2024-05-25 21:49:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:49:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:49:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:49:03] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:49:03] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:49:04] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7220 reset in 327 ms.
Product exploration explored 100000 steps with 7216 reset in 356 ms.
Built C files in :
/tmp/ltsmin14936978651550681911
[2024-05-25 21:49:04] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-25 21:49:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:04] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-25 21:49:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:04] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-25 21:49:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14936978651550681911
Running compilation step : cd /tmp/ltsmin14936978651550681911;'/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 466 ms.
Running link step : cd /tmp/ltsmin14936978651550681911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin14936978651550681911;'/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/stateBased12859977123874385454.hoa' '--buchi-type=spotba'
LTSmin run took 266 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-03 finished in 6127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:49:05] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 21:49:05] [INFO ] Implicit Places using invariants in 132 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 20, 21, 25, 26, 27]
[2024-05-25 21:49:05] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 20, 21, 25]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 134 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-04 finished in 282 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) U (!p1&&X(!p2)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:49:05] [INFO ] Computed 15 invariants in 3 ms
[2024-05-25 21:49:06] [INFO ] Implicit Places using invariants in 85 ms returned [6, 7, 11, 15, 19, 21, 25, 26, 27]
[2024-05-25 21:49:06] [INFO ] Actually due to overlaps returned [6, 11, 19, 21, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 86 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 26/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR p1 p2), p0, (OR p1 p2), p2, (AND p0 (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-05
Product exploration explored 100000 steps with 4723 reset in 192 ms.
Product exploration explored 100000 steps with 4735 reset in 231 ms.
Computed a total of 26 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 p2))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 238 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR p2 p1), p0, (OR p2 p1), p2, false, false]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40003 steps (831 resets) in 670 ms. (59 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40000 steps (516 resets) in 432 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (485 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
// Phase 1: matrix 16 rows 26 cols
[2024-05-25 21:49:07] [INFO ] Computed 10 invariants in 1 ms
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 9/42 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 p2))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p2) p1)))
Knowledge based reduction with 24 factoid took 368 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-05 finished in 2345 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((X(F(p0))&&G((F(p2)&&p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:49:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 21:49:08] [INFO ] Implicit Places using invariants in 108 ms returned [6, 7, 11, 15, 18, 19, 20, 25]
[2024-05-25 21:49:08] [INFO ] Actually due to overlaps returned [6, 11, 18, 19, 20]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 110 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-07
Stuttering criterion allowed to conclude after 84 steps with 4 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-07 finished in 366 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)||X((G(F(p1))||((p0 U !p3)&&p2)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:49:08] [INFO ] Invariant cache hit.
[2024-05-25 21:49:08] [INFO ] Implicit Places using invariants in 70 ms returned [6, 7, 11, 15, 18, 19, 24, 26]
[2024-05-25 21:49:08] [INFO ] Actually due to overlaps returned [6, 11, 18, 19, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 72 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-08
Product exploration explored 100000 steps with 9658 reset in 133 ms.
Product exploration explored 100000 steps with 9671 reset in 163 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p2)), (X p3), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 121 steps (0 resets) in 5 ms. (20 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p2)), (X p3), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 319 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
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))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 16 rows 25 cols
[2024-05-25 21:49:10] [INFO ] Computed 9 invariants in 1 ms
[2024-05-25 21:49:10] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-25 21:49:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 21:49:10] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:49:10] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:49:10] [INFO ] Invariant cache hit.
[2024-05-25 21:49:10] [INFO ] Implicit Places using invariants in 35 ms returned [6, 13, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 22/25 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 108 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(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 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 16 rows 22 cols
[2024-05-25 21:49:11] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 21:49:11] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 21:49:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:49:11] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 21:49:11] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:49:11] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 209 ms :[(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 9653 reset in 119 ms.
Product exploration explored 100000 steps with 9694 reset in 135 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 37 edges and 22 vertex of which 16 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 2 place count 16 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 16 transition count 12
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 15 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 15 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 12 ms. Remains 15 /22 variables (removed 7) and now considering 11/16 (removed 5) transitions.
[2024-05-25 21:49:13] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-25 21:49:13] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
At refinement iteration 2 (OVERLAPS) 11/25 variables, 14/18 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 4 solved, 6 unsolved in 156 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 6/23 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/26 variables, 2/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 25 constraints, problems are : Problem set: 4 solved, 6 unsolved in 181 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 4 solved, 6 unsolved
Search for dead transitions found 4 dead transitions in 346ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 7/16 transitions.
Graph (complete) has 18 edges and 15 vertex of which 11 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/22 places, 7/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 11/22 places, 7/16 transitions.
Built C files in :
/tmp/ltsmin2127271536248055121
[2024-05-25 21:49:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2127271536248055121
Running compilation step : cd /tmp/ltsmin2127271536248055121;'/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 199 ms.
Running link step : cd /tmp/ltsmin2127271536248055121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2127271536248055121;'/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/stateBased15826043612789452143.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-08 finished in 5281 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 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-05-25 21:49:13] [INFO ] Computed 6 invariants in 2 ms
[2024-05-25 21:49:13] [INFO ] Implicit Places using invariants in 50 ms returned [3, 7, 10, 11]
[2024-05-25 21:49:13] [INFO ] Actually due to overlaps returned [3, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Applied a total of 2 rules in 4 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-25 21:49:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 21:49:14] [INFO ] Implicit Places using invariants in 32 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32 places, 6/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 4 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-25 21:49:14] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 21:49:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 21:49:14] [INFO ] Invariant cache hit.
[2024-05-25 21:49:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 154 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-09
Product exploration explored 100000 steps with 19518 reset in 88 ms.
Product exploration explored 100000 steps with 19537 reset in 107 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-25 21:49:14] [INFO ] Invariant cache hit.
[2024-05-25 21:49:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:49:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:49:14] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:49:14] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 21:49:14] [INFO ] Invariant cache hit.
[2024-05-25 21:49:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 21:49:14] [INFO ] Invariant cache hit.
[2024-05-25 21:49:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-25 21:49:14] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 21:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-05-25 21:49:15] [INFO ] Invariant cache hit.
[2024-05-25 21:49:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:49:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:49:15] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:49:15] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19524 reset in 88 ms.
Product exploration explored 100000 steps with 19535 reset in 111 ms.
Built C files in :
/tmp/ltsmin9611212289341764072
[2024-05-25 21:49:15] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 21:49:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:15] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 21:49:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:15] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 21:49:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9611212289341764072
Running compilation step : cd /tmp/ltsmin9611212289341764072;'/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 147 ms.
Running link step : cd /tmp/ltsmin9611212289341764072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9611212289341764072;'/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/stateBased10252431202753754407.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-09 finished in 2302 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)||F(p1)||((!p0 U p2) U p3)))'
Support contains 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-05-25 21:49:16] [INFO ] Computed 12 invariants in 1 ms
[2024-05-25 21:49:16] [INFO ] Implicit Places using invariants in 54 ms returned [9, 10, 14, 15, 20, 22]
[2024-05-25 21:49:16] [INFO ] Actually due to overlaps returned [9, 14, 15, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 14/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 12
Applied a total of 4 rules in 6 ms. Remains 20 /22 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-25 21:49:16] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 21:49:16] [INFO ] Implicit Places using invariants in 33 ms returned [8, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32 places, 12/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 11
Applied a total of 2 rules in 4 ms. Remains 17 /18 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-25 21:49:16] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 21:49:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 21:49:16] [INFO ] Invariant cache hit.
[2024-05-25 21:49:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/32 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 164 ms. Remains : 17/32 places, 11/16 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND p0 (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-10
Product exploration explored 100000 steps with 8283 reset in 76 ms.
Product exploration explored 100000 steps with 8280 reset in 112 ms.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 234 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 69 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 27 factoid took 285 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
[2024-05-25 21:49:17] [INFO ] Invariant cache hit.
[2024-05-25 21:49:17] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:49:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:49:17] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:49:17] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:49:17] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-25 21:49:17] [INFO ] Invariant cache hit.
[2024-05-25 21:49:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 21:49:17] [INFO ] Invariant cache hit.
[2024-05-25 21:49:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-25 21:49:17] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-25 21:49:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/27 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/28 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 202 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/27 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 225 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 434ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 535 ms. Remains : 17/17 places, 11/11 transitions.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 75 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
[2024-05-25 21:49:18] [INFO ] Invariant cache hit.
[2024-05-25 21:49:19] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:49:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:49:19] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:49:19] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:49:19] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8290 reset in 123 ms.
Product exploration explored 100000 steps with 8289 reset in 136 ms.
Built C files in :
/tmp/ltsmin15962828784501747596
[2024-05-25 21:49:19] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-25 21:49:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:19] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-25 21:49:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:19] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-25 21:49:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:49:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15962828784501747596
Running compilation step : cd /tmp/ltsmin15962828784501747596;'/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 186 ms.
Running link step : cd /tmp/ltsmin15962828784501747596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15962828784501747596;'/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/stateBased11206540238657550921.hoa' '--buchi-type=spotba'
LTSmin run took 339 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-10 finished in 3863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:49:20] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 21:49:20] [INFO ] Implicit Places using invariants in 88 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 20, 21, 25, 26, 27]
[2024-05-25 21:49:20] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 20, 21, 25]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 90 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-11 finished in 423 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 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-05-25 21:49:20] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 21:49:20] [INFO ] Implicit Places using invariants in 34 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/32 places, 4/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 5 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4 transition count 2
Applied a total of 2 rules in 2 ms. Remains 4 /6 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-05-25 21:49:20] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 21:49:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 21:49:20] [INFO ] Invariant cache hit.
[2024-05-25 21:49:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT 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 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-12 finished in 368 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' '!(((!p0||X(F((!p0&&F((!p0 U (G(!p0)||(!p0&&G(!p1))))))))) U G(p2)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 22 /32 variables (removed 10) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 22 cols
[2024-05-25 21:49:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 21:49:20] [INFO ] Implicit Places using invariants in 55 ms returned [3, 7, 10, 11]
[2024-05-25 21:49:20] [INFO ] Actually due to overlaps returned [3, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 10
Applied a total of 2 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 17 cols
[2024-05-25 21:49:20] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 21:49:20] [INFO ] Implicit Places using invariants in 38 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 10/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 106 ms. Remains : 16/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), p0, false, (AND p0 p1), false]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-13
Stuttering criterion allowed to conclude after 183 steps with 8 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-13 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (F(p1) U X(X(p2)))) U p2))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:49:21] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 21:49:21] [INFO ] Implicit Places using invariants in 87 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 24, 26]
[2024-05-25 21:49:21] [INFO ] Actually due to overlaps returned [3, 11, 13, 18, 19, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 89 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 719 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-14
Product exploration explored 100000 steps with 5699 reset in 143 ms.
Product exploration explored 100000 steps with 5719 reset in 160 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 272 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 997 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 168 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 23 factoid took 757 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 713 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 713 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 21:49:25] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 21:49:26] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-25 21:49:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 21:49:26] [INFO ] Computed and/alt/rep : 15/31/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:49:26] [INFO ] Added : 13 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:49:26] [INFO ] Invariant cache hit.
[2024-05-25 21:49:26] [INFO ] Implicit Places using invariants in 52 ms returned [4, 11, 12, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 20/24 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 267 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 717 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 164 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 23 factoid took 762 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 823 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 729 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 16 rows 20 cols
[2024-05-25 21:49:29] [INFO ] Computed 4 invariants in 4 ms
[2024-05-25 21:49:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 21:49:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 21:49:29] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:49:29] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 854 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5730 reset in 114 ms.
Product exploration explored 100000 steps with 5716 reset in 131 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 719 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 20 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 16
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 16 transition count 12
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 16 rules in 6 ms. Remains 16 /20 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2024-05-25 21:49:31] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-25 21:49:31] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/28 variables, 1/20 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 20 constraints, problems are : Problem set: 4 solved, 7 unsolved in 175 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 12/26 variables, 14/18 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 7/25 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/28 variables, 2/27 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/28 variables, 0/27 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 27 constraints, problems are : Problem set: 4 solved, 7 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 4 solved, 7 unsolved
Search for dead transitions found 4 dead transitions in 391ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 8/16 transitions.
Graph (complete) has 19 edges and 16 vertex of which 12 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/20 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 409 ms. Remains : 12/20 places, 8/16 transitions.
Built C files in :
/tmp/ltsmin11019264940006157378
[2024-05-25 21:49:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11019264940006157378
Running compilation step : cd /tmp/ltsmin11019264940006157378;'/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 190 ms.
Running link step : cd /tmp/ltsmin11019264940006157378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11019264940006157378;'/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/stateBased17541599052869966710.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-14 finished in 11301 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(!p1)) U G(p0))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-25 21:49:32] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 21:49:32] [INFO ] Implicit Places using invariants in 99 ms returned [3, 5, 6, 7, 11, 15, 20, 21, 25, 26, 27]
[2024-05-25 21:49:32] [INFO ] Actually due to overlaps returned [3, 6, 11, 20, 21, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), true, p1, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-15 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 39477 ms.

BK_STOP 1716673773326

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="PermAdmissibility-COL-02"
export BK_EXAMINATION="LTLFireability"
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 PermAdmissibility-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406900116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;