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.r157-smll-171636265700404.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 greatspnxred
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265700404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K Apr 11 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 20:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 20:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 21:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 21:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 137K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716625768067

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 08:29:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 08:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:29:30] [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 08:29:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 08:29:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1799 ms
[2024-05-25 08:29:32] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2024-05-25 08:29:32] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 08:29:32] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 12 ms.
[2024-05-25 08:29:32] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40039 steps (12 resets) in 522 ms. (76 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
// Phase 1: matrix 66 rows 99 cols
[2024-05-25 08:29:33] [INFO ] Computed 33 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/94 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/99 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 66/165 variables, 99/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/94 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/99 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 66/165 variables, 99/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/165 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 134 constraints, problems are : Problem set: 0 solved, 2 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 956ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 163 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 17 ms.
[2024-05-25 08:29:34] [INFO ] Flatten gal took : 57 ms
[2024-05-25 08:29:34] [INFO ] Flatten gal took : 22 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2024-05-25 08:29:34] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 321 ms.
[2024-05-25 08:29:34] [INFO ] Unfolded 14 HLPN properties in 2 ms.
[2024-05-25 08:29:34] [INFO ] Reduced 255 identical enabling conditions.
[2024-05-25 08:29:34] [INFO ] Reduced 102 identical enabling conditions.
Deduced a syphon composed of 51 places in 69 ms
Reduce places removed 64 places and 0 transitions.
Support contains 4090 out of 11403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Reduce places removed 168 places and 0 transitions.
Discarding 1122 places :
Implicit places reduction removed 1122 places
Iterating post reduction 0 with 1290 rules applied. Total rules applied 1290 place count 10113 transition count 9336
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 1595 place count 9808 transition count 9031
Iterating global reduction 1 with 305 rules applied. Total rules applied 1900 place count 9808 transition count 9031
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 2155 place count 9553 transition count 8776
Iterating global reduction 1 with 255 rules applied. Total rules applied 2410 place count 9553 transition count 8776
Applied a total of 2410 rules in 4254 ms. Remains 9553 /11403 variables (removed 1850) and now considering 8776/9336 (removed 560) transitions.
// Phase 1: matrix 8776 rows 9553 cols
[2024-05-25 08:29:40] [INFO ] Computed 1535 invariants in 1028 ms
[2024-05-25 08:29:46] [INFO ] Implicit Places using invariants in 6665 ms returned [867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 2040, 6225, 6226, 6227, 6228, 6229, 6230, 6231, 6232, 6233, 6234, 6235, 6236, 6237, 6238, 6239, 6240, 6241, 6242, 6243, 6244, 6245, 6246, 6247, 6248, 6249, 6250, 6251, 6252, 6253, 6254, 6255, 6256, 6257, 6258, 6259, 6260, 6261, 6262, 6263, 6264, 6265, 6266, 6267, 6268, 6269, 6270, 6271, 6272, 6273, 6274, 6275, 7048, 7049, 7050, 7051, 7052, 7053, 7054, 7055, 7056, 7057, 7058, 7059, 7060, 7061, 7062, 7063, 7064, 7065, 7066, 7067, 7068, 7069, 7070, 7071, 7072, 7073, 7074, 7075, 7076, 7077, 7078, 7079, 7080, 7081, 7082, 7083, 7084, 7085, 7086, 7087, 7088, 7089, 7090, 7091, 7092, 7093, 7094, 7095, 7096, 7097, 7098]
Discarding 154 places :
Implicit Place search using SMT only with invariants took 6692 ms to find 154 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9399/11403 places, 8776/9336 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 9349 transition count 8726
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 9349 transition count 8726
Applied a total of 100 rules in 2031 ms. Remains 9349 /9399 variables (removed 50) and now considering 8726/8776 (removed 50) transitions.
// Phase 1: matrix 8726 rows 9349 cols
[2024-05-25 08:29:48] [INFO ] Computed 1381 invariants in 305 ms
[2024-05-25 08:29:52] [INFO ] Implicit Places using invariants in 4392 ms returned []
[2024-05-25 08:29:52] [INFO ] Invariant cache hit.
[2024-05-25 08:30:17] [INFO ] Implicit Places using invariants and state equation in 25284 ms returned []
Implicit Place search using SMT with State Equation took 29682 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 9349/11403 places, 8726/9336 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42694 ms. Remains : 9349/11403 places, 8726/9336 transitions.
Support contains 4090 out of 9349 places after structural reductions.
[2024-05-25 08:30:18] [INFO ] Flatten gal took : 781 ms
[2024-05-25 08:30:19] [INFO ] Flatten gal took : 350 ms
[2024-05-25 08:30:20] [INFO ] Input system was already deterministic with 8726 transitions.
Reduction of identical properties reduced properties to check from 27 to 24
RANDOM walk for 40000 steps (12 resets) in 2705 ms. (14 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1057 ms. (37 steps per ms) remains 1/1 properties
[2024-05-25 08:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5726/5828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2978/8806 variables, 1288/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8806 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 180/8986 variables, 90/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8986 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5196ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 9349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Graph (complete) has 12649 edges and 9349 vertex of which 9344 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.26 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5457 transitions
Trivial Post-agglo rules discarded 5457 transitions
Performed 5457 trivial Post agglomeration. Transition count delta: 5457
Iterating post reduction 0 with 6426 rules applied. Total rules applied 6427 place count 8426 transition count 3213
Reduce places removed 5457 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 5763 rules applied. Total rules applied 12190 place count 2969 transition count 2907
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 12496 place count 2663 transition count 2907
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 765 Pre rules applied. Total rules applied 12496 place count 2663 transition count 2142
Deduced a syphon composed of 765 places in 2 ms
Ensure Unique test removed 357 places
Reduce places removed 1122 places and 0 transitions.
Iterating global reduction 3 with 1887 rules applied. Total rules applied 14383 place count 1541 transition count 2142
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 14587 place count 1541 transition count 1938
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 14791 place count 1337 transition count 1938
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 14791 place count 1337 transition count 1887
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 14893 place count 1286 transition count 1887
Discarding 464 places :
Symmetric choice reduction at 5 with 464 rule applications. Total rules 15357 place count 822 transition count 1173
Iterating global reduction 5 with 464 rules applied. Total rules applied 15821 place count 822 transition count 1173
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 5 with 357 rules applied. Total rules applied 16178 place count 822 transition count 816
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 16280 place count 720 transition count 816
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 102 Pre rules applied. Total rules applied 16280 place count 720 transition count 714
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 16484 place count 618 transition count 714
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 16486 place count 616 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 16488 place count 616 transition count 612
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 7 with 204 rules applied. Total rules applied 16692 place count 565 transition count 459
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 16743 place count 514 transition count 459
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 16845 place count 463 transition count 408
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 9 with 102 rules applied. Total rules applied 16947 place count 463 transition count 306
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 9 with 153 rules applied. Total rules applied 17100 place count 310 transition count 306
Applied a total of 17100 rules in 1375 ms. Remains 310 /9349 variables (removed 9039) and now considering 306/8726 (removed 8420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1375 ms. Remains : 310/9349 places, 306/8726 transitions.
RANDOM walk for 279 steps (0 resets) in 9 ms. (27 steps per ms) remains 0/1 properties
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9349 stabilizing places and 8726 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9349 transition count 8726
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(X(X(X(F((!p0||X(F((F(p0)&&p1))))))))))'
Support contains 51 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7663 transition count 7958
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7663 transition count 7958
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 2512 place count 7605 transition count 7550
Iterating global reduction 1 with 58 rules applied. Total rules applied 2570 place count 7605 transition count 7550
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2621 place count 7554 transition count 7550
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3028 place count 7147 transition count 7143
Iterating global reduction 2 with 407 rules applied. Total rules applied 3435 place count 7147 transition count 7143
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3842 place count 6740 transition count 6686
Iterating global reduction 2 with 407 rules applied. Total rules applied 4249 place count 6740 transition count 6686
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 4554 place count 6435 transition count 6381
Iterating global reduction 2 with 305 rules applied. Total rules applied 4859 place count 6435 transition count 6381
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5164 place count 6130 transition count 6076
Iterating global reduction 2 with 305 rules applied. Total rules applied 5469 place count 6130 transition count 6076
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5774 place count 5825 transition count 5771
Iterating global reduction 2 with 305 rules applied. Total rules applied 6079 place count 5825 transition count 5771
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 6384 place count 5520 transition count 5466
Iterating global reduction 2 with 305 rules applied. Total rules applied 6689 place count 5520 transition count 5466
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6690 place count 5519 transition count 5466
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 6995 place count 5214 transition count 5161
Iterating global reduction 3 with 305 rules applied. Total rules applied 7300 place count 5214 transition count 5161
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7555 place count 4959 transition count 4906
Iterating global reduction 3 with 255 rules applied. Total rules applied 7810 place count 4959 transition count 4906
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8065 place count 4704 transition count 4651
Iterating global reduction 3 with 255 rules applied. Total rules applied 8320 place count 4704 transition count 4651
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8575 place count 4449 transition count 4396
Iterating global reduction 3 with 255 rules applied. Total rules applied 8830 place count 4449 transition count 4396
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9085 place count 4194 transition count 4141
Iterating global reduction 3 with 255 rules applied. Total rules applied 9340 place count 4194 transition count 4141
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9595 place count 3939 transition count 3886
Iterating global reduction 3 with 255 rules applied. Total rules applied 9850 place count 3939 transition count 3886
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 10105 place count 3684 transition count 3631
Iterating global reduction 3 with 255 rules applied. Total rules applied 10360 place count 3684 transition count 3631
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 10615 place count 3684 transition count 3376
Applied a total of 10615 rules in 20200 ms. Remains 3684 /9349 variables (removed 5665) and now considering 3376/8726 (removed 5350) transitions.
// Phase 1: matrix 3376 rows 3684 cols
[2024-05-25 08:30:49] [INFO ] Computed 411 invariants in 55 ms
[2024-05-25 08:30:51] [INFO ] Implicit Places using invariants in 1955 ms returned [1540, 2051, 2052, 2053, 2054, 2055, 2056, 2057, 2058, 2059, 2060, 2061, 2062, 2063, 2064, 2065, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2075, 2076, 2077, 2078, 2079, 2080, 2081, 2082, 2083, 2084, 2085, 2086, 2087, 2088, 2089, 2090, 2091, 2092, 2093, 2094, 2095, 2096, 2097, 2098, 2099, 2100, 2101, 3071]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 1958 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3631/9349 places, 3376/8726 transitions.
Applied a total of 0 rules in 399 ms. Remains 3631 /3631 variables (removed 0) and now considering 3376/3376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22559 ms. Remains : 3631/9349 places, 3376/8726 transitions.
Stuttering acceptance computed with spot in 569 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 1236 ms.
Product exploration explored 100000 steps with 20000 reset in 959 ms.
Computed a total of 3631 stabilizing places and 3376 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3631 transition count 3376
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) p1), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 finished in 27120 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((X(X(G(p0))) U (F(p1)&&(F(!p3)||p2))))))'
Support contains 669 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7663 transition count 7958
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7663 transition count 7958
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 2507 place count 7610 transition count 7805
Iterating global reduction 1 with 53 rules applied. Total rules applied 2560 place count 7610 transition count 7805
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2611 place count 7559 transition count 7805
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 2763 place count 7407 transition count 7653
Iterating global reduction 2 with 152 rules applied. Total rules applied 2915 place count 7407 transition count 7653
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 3067 place count 7255 transition count 7451
Iterating global reduction 2 with 152 rules applied. Total rules applied 3219 place count 7255 transition count 7451
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 3269 place count 7205 transition count 7401
Iterating global reduction 2 with 50 rules applied. Total rules applied 3319 place count 7205 transition count 7401
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 3369 place count 7155 transition count 7351
Iterating global reduction 2 with 50 rules applied. Total rules applied 3419 place count 7155 transition count 7351
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 3469 place count 7105 transition count 7301
Iterating global reduction 2 with 50 rules applied. Total rules applied 3519 place count 7105 transition count 7301
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 3569 place count 7055 transition count 7251
Iterating global reduction 2 with 50 rules applied. Total rules applied 3619 place count 7055 transition count 7251
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 3620 place count 7054 transition count 7251
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 3670 place count 7004 transition count 7201
Iterating global reduction 3 with 50 rules applied. Total rules applied 3720 place count 7004 transition count 7201
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 3770 place count 6954 transition count 7151
Iterating global reduction 3 with 50 rules applied. Total rules applied 3820 place count 6954 transition count 7151
Applied a total of 3820 rules in 15787 ms. Remains 6954 /9349 variables (removed 2395) and now considering 7151/8726 (removed 1575) transitions.
// Phase 1: matrix 7151 rows 6954 cols
[2024-05-25 08:31:11] [INFO ] Computed 411 invariants in 122 ms
[2024-05-25 08:31:14] [INFO ] Implicit Places using invariants in 2873 ms returned [5321, 5322, 5323, 5324, 5325, 5326, 5327, 5328, 5329, 5330, 5331, 5332, 5333, 5334, 5335, 5336, 5337, 5338, 5339, 5340, 5341, 5342, 5343, 5344, 5345, 5346, 5347, 5348, 5349, 5350, 5351, 5352, 5353, 5354, 5355, 5356, 5357, 5358, 5359, 5360, 5361, 5362, 5363, 5364, 5365, 5366, 5367, 5368, 5369, 5370, 5371, 6341]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 2879 ms to find 52 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6902/9349 places, 7151/8726 transitions.
Applied a total of 0 rules in 1246 ms. Remains 6902 /6902 variables (removed 0) and now considering 7151/7151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19915 ms. Remains : 6902/9349 places, 7151/8726 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p1) (AND (NOT p2) p3)), (OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p2) p3) (AND (NOT p0) p3)), (AND p3 (NOT p0)), (AND (NOT p1) p3), p3]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01
Product exploration explored 100000 steps with 94 reset in 1597 ms.
Product exploration explored 100000 steps with 96 reset in 1792 ms.
Computed a total of 6902 stabilizing places and 7151 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6902 transition count 7151
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 p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 128 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4185 steps (0 resets) in 78 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 14 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 finished in 27133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 210 out of 9349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Graph (complete) has 12649 edges and 9349 vertex of which 6636 are kept as prefixes of interest. Removing 2713 places using SCC suffix rule.22 ms
Discarding 2713 places :
Also discarding 2402 output transitions
Drop transitions (Output transitions of discarded places.) removed 2402 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4131 transitions
Trivial Post-agglo rules discarded 4131 transitions
Performed 4131 trivial Post agglomeration. Transition count delta: 4131
Iterating post reduction 0 with 5049 rules applied. Total rules applied 5050 place count 5667 transition count 2142
Reduce places removed 4131 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 4437 rules applied. Total rules applied 9487 place count 1536 transition count 1836
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 9793 place count 1230 transition count 1836
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 9793 place count 1230 transition count 1683
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 10099 place count 1077 transition count 1683
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 10354 place count 822 transition count 1428
Iterating global reduction 3 with 255 rules applied. Total rules applied 10609 place count 822 transition count 1428
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 10711 place count 771 transition count 1887
Applied a total of 10711 rules in 388 ms. Remains 771 /9349 variables (removed 8578) and now considering 1887/8726 (removed 6839) transitions.
// Phase 1: matrix 1887 rows 771 cols
[2024-05-25 08:31:23] [INFO ] Computed 1 invariants in 19 ms
[2024-05-25 08:31:23] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 08:31:23] [INFO ] Invariant cache hit.
[2024-05-25 08:31:24] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2024-05-25 08:31:24] [INFO ] Redundant transitions in 159 ms returned []
Running 1581 sub problems to find dead transitions.
[2024-05-25 08:31:24] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 720/2658 variables, and 1 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30113 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/771 constraints, PredecessorRefiner: 1581/1581 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/2658 variables, and 1 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30058 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/771 constraints, PredecessorRefiner: 0/1581 constraints, Known Traps: 0/0 constraints]
After SMT, in 64439ms problems are : Problem set: 0 solved, 1581 unsolved
Search for dead transitions found 0 dead transitions in 64476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/9349 places, 1887/8726 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66002 ms. Remains : 771/9349 places, 1887/8726 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02
Product exploration explored 100000 steps with 1048 reset in 2328 ms.
Product exploration explored 100000 steps with 1052 reset in 2017 ms.
Computed a total of 771 stabilizing places and 1887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 771 transition count 1887
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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 32 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 finished in 75135 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((F(p0)&&X(G(p1)))))'
Support contains 663 out of 9349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Graph (complete) has 12649 edges and 9349 vertex of which 9088 are kept as prefixes of interest. Removing 261 places using SCC suffix rule.22 ms
Discarding 261 places :
Also discarding 311 output transitions
Drop transitions (Output transitions of discarded places.) removed 311 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4692 transitions
Trivial Post-agglo rules discarded 4692 transitions
Performed 4692 trivial Post agglomeration. Transition count delta: 4692
Iterating post reduction 0 with 5304 rules applied. Total rules applied 5305 place count 8425 transition count 3672
Reduce places removed 4692 places and 0 transitions.
Iterating post reduction 1 with 4692 rules applied. Total rules applied 9997 place count 3733 transition count 3672
Performed 1020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1020 Pre rules applied. Total rules applied 9997 place count 3733 transition count 2652
Deduced a syphon composed of 1020 places in 1 ms
Ensure Unique test removed 357 places
Reduce places removed 1377 places and 0 transitions.
Iterating global reduction 2 with 2397 rules applied. Total rules applied 12394 place count 2356 transition count 2652
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 12598 place count 2356 transition count 2448
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 12802 place count 2152 transition count 2448
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 12802 place count 2152 transition count 2397
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 12904 place count 2101 transition count 2397
Discarding 209 places :
Symmetric choice reduction at 4 with 209 rule applications. Total rules 13113 place count 1892 transition count 1938
Iterating global reduction 4 with 209 rules applied. Total rules applied 13322 place count 1892 transition count 1938
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 4 with 102 rules applied. Total rules applied 13424 place count 1892 transition count 1836
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 13526 place count 1790 transition count 1836
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 13526 place count 1790 transition count 1785
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 13628 place count 1739 transition count 1785
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 13630 place count 1737 transition count 1683
Iterating global reduction 6 with 2 rules applied. Total rules applied 13632 place count 1737 transition count 1683
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 6 with 204 rules applied. Total rules applied 13836 place count 1686 transition count 1530
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 13887 place count 1635 transition count 1530
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13989 place count 1584 transition count 1479
Applied a total of 13989 rules in 1052 ms. Remains 1584 /9349 variables (removed 7765) and now considering 1479/8726 (removed 7247) transitions.
// Phase 1: matrix 1479 rows 1584 cols
[2024-05-25 08:32:39] [INFO ] Computed 360 invariants in 21 ms
[2024-05-25 08:32:39] [INFO ] Implicit Places using invariants in 756 ms returned [1429, 1430, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 758 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1531/9349 places, 1479/8726 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 1531 transition count 1428
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 1480 transition count 1428
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 1480 transition count 1377
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 1429 transition count 1377
Applied a total of 204 rules in 60 ms. Remains 1429 /1531 variables (removed 102) and now considering 1377/1479 (removed 102) transitions.
// Phase 1: matrix 1377 rows 1429 cols
[2024-05-25 08:32:40] [INFO ] Computed 307 invariants in 11 ms
[2024-05-25 08:32:40] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-25 08:32:40] [INFO ] Invariant cache hit.
[2024-05-25 08:32:42] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1429/9349 places, 1377/8726 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4070 ms. Remains : 1429/9349 places, 1377/8726 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03
Product exploration explored 100000 steps with 476 reset in 2414 ms.
Product exploration explored 100000 steps with 476 reset in 1823 ms.
Computed a total of 1429 stabilizing places and 1377 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1429 transition count 1377
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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 28 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 finished in 12567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 357 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 666 places :
Symmetric choice reduction at 1 with 666 rule applications. Total rules 1584 place count 7765 transition count 8060
Iterating global reduction 1 with 666 rules applied. Total rules applied 2250 place count 7765 transition count 8060
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 2306 place count 7709 transition count 7754
Iterating global reduction 1 with 56 rules applied. Total rules applied 2362 place count 7709 transition count 7754
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 2667 place count 7404 transition count 7449
Iterating global reduction 1 with 305 rules applied. Total rules applied 2972 place count 7404 transition count 7449
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 3277 place count 7099 transition count 7094
Iterating global reduction 1 with 305 rules applied. Total rules applied 3582 place count 7099 transition count 7094
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 3887 place count 6794 transition count 6789
Iterating global reduction 1 with 305 rules applied. Total rules applied 4192 place count 6794 transition count 6789
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 4497 place count 6489 transition count 6484
Iterating global reduction 1 with 305 rules applied. Total rules applied 4802 place count 6489 transition count 6484
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 5107 place count 6184 transition count 6179
Iterating global reduction 1 with 305 rules applied. Total rules applied 5412 place count 6184 transition count 6179
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 5717 place count 5879 transition count 5874
Iterating global reduction 1 with 305 rules applied. Total rules applied 6022 place count 5879 transition count 5874
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 6023 place count 5878 transition count 5874
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 6328 place count 5573 transition count 5569
Iterating global reduction 2 with 305 rules applied. Total rules applied 6633 place count 5573 transition count 5569
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 6938 place count 5268 transition count 5264
Iterating global reduction 2 with 305 rules applied. Total rules applied 7243 place count 5268 transition count 5264
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7498 place count 5013 transition count 5009
Iterating global reduction 2 with 255 rules applied. Total rules applied 7753 place count 5013 transition count 5009
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8008 place count 4758 transition count 4754
Iterating global reduction 2 with 255 rules applied. Total rules applied 8263 place count 4758 transition count 4754
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8518 place count 4503 transition count 4499
Iterating global reduction 2 with 255 rules applied. Total rules applied 8773 place count 4503 transition count 4499
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9028 place count 4248 transition count 4244
Iterating global reduction 2 with 255 rules applied. Total rules applied 9283 place count 4248 transition count 4244
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9538 place count 3993 transition count 3989
Iterating global reduction 2 with 255 rules applied. Total rules applied 9793 place count 3993 transition count 3989
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 10048 place count 3993 transition count 3734
Applied a total of 10048 rules in 16964 ms. Remains 3993 /9349 variables (removed 5356) and now considering 3734/8726 (removed 4992) transitions.
// Phase 1: matrix 3734 rows 3993 cols
[2024-05-25 08:33:07] [INFO ] Computed 462 invariants in 80 ms
[2024-05-25 08:33:10] [INFO ] Implicit Places using invariants in 2427 ms returned [1490, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 2050, 2051]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 2431 ms to find 52 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3941/9349 places, 3734/8726 transitions.
Applied a total of 0 rules in 504 ms. Remains 3941 /3941 variables (removed 0) and now considering 3734/3734 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19902 ms. Remains : 3941/9349 places, 3734/8726 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
Product exploration explored 100000 steps with 34 reset in 2206 ms.
Product exploration explored 100000 steps with 34 reset in 2352 ms.
Computed a total of 3941 stabilizing places and 3734 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3941 transition count 3734
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) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 156 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 6551 steps (0 resets) in 447 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 397 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 3734 rows 3941 cols
[2024-05-25 08:33:18] [INFO ] Computed 410 invariants in 36 ms
[2024-05-25 08:33:28] [INFO ] [Real]Absence check using 0 positive and 410 generalized place invariants in 1115 ms returned sat
[2024-05-25 08:33:33] [INFO ] [Real]Absence check using state equation in 5652 ms returned unknown
Could not prove EG (NOT p0)
Support contains 357 out of 3941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3941/3941 places, 3734/3734 transitions.
Graph (complete) has 5009 edges and 3941 vertex of which 3012 are kept as prefixes of interest. Removing 929 places using SCC suffix rule.6 ms
Discarding 929 places :
Also discarding 725 output transitions
Drop transitions (Output transitions of discarded places.) removed 725 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1581 transitions
Trivial Post-agglo rules discarded 1581 transitions
Performed 1581 trivial Post agglomeration. Transition count delta: 1581
Iterating post reduction 0 with 1581 rules applied. Total rules applied 1582 place count 2961 transition count 1377
Reduce places removed 1581 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 1734 rules applied. Total rules applied 3316 place count 1380 transition count 1224
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 3469 place count 1227 transition count 1224
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 3469 place count 1227 transition count 816
Deduced a syphon composed of 408 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 4438 place count 666 transition count 816
Applied a total of 4438 rules in 203 ms. Remains 666 /3941 variables (removed 3275) and now considering 816/3734 (removed 2918) transitions.
// Phase 1: matrix 816 rows 666 cols
[2024-05-25 08:33:34] [INFO ] Computed 52 invariants in 9 ms
[2024-05-25 08:33:34] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-25 08:33:34] [INFO ] Invariant cache hit.
[2024-05-25 08:33:35] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2024-05-25 08:33:35] [INFO ] Redundant transitions in 8 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-25 08:33:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 666/3941 places, 816/3734 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61705 ms. Remains : 666/3941 places, 816/3734 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
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) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 306 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1155 steps (0 resets) in 29 ms. (38 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 569 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-25 08:34:38] [INFO ] Invariant cache hit.
[2024-05-25 08:34:41] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 82 ms returned sat
[2024-05-25 08:34:42] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2024-05-25 08:34:43] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 121 ms.
[2024-05-25 08:34:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:48] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 47 ms returned sat
[2024-05-25 08:34:49] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2024-05-25 08:34:49] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 121 ms.
[2024-05-25 08:34:53] [INFO ] Added : 208 causal constraints over 42 iterations in 3797 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1917 ms.
Product exploration explored 100000 steps with 325 reset in 1576 ms.
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 15 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-25 08:34:57] [INFO ] Invariant cache hit.
[2024-05-25 08:34:57] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 08:34:57] [INFO ] Invariant cache hit.
[2024-05-25 08:34:58] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2024-05-25 08:34:58] [INFO ] Redundant transitions in 72 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-25 08:34:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60662ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61981 ms. Remains : 666/666 places, 816/816 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 finished in 189188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 663 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8737 transition count 8726
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1380 place count 7969 transition count 7958
Iterating global reduction 1 with 768 rules applied. Total rules applied 2148 place count 7969 transition count 7958
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 2206 place count 7911 transition count 7550
Iterating global reduction 1 with 58 rules applied. Total rules applied 2264 place count 7911 transition count 7550
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2315 place count 7860 transition count 7550
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 2722 place count 7453 transition count 7143
Iterating global reduction 2 with 407 rules applied. Total rules applied 3129 place count 7453 transition count 7143
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3536 place count 7046 transition count 6686
Iterating global reduction 2 with 407 rules applied. Total rules applied 3943 place count 7046 transition count 6686
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 4248 place count 6741 transition count 6381
Iterating global reduction 2 with 305 rules applied. Total rules applied 4553 place count 6741 transition count 6381
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 4858 place count 6436 transition count 6076
Iterating global reduction 2 with 305 rules applied. Total rules applied 5163 place count 6436 transition count 6076
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5468 place count 6131 transition count 5771
Iterating global reduction 2 with 305 rules applied. Total rules applied 5773 place count 6131 transition count 5771
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 6078 place count 5826 transition count 5466
Iterating global reduction 2 with 305 rules applied. Total rules applied 6383 place count 5826 transition count 5466
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6384 place count 5825 transition count 5466
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 6689 place count 5520 transition count 5161
Iterating global reduction 3 with 305 rules applied. Total rules applied 6994 place count 5520 transition count 5161
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 7044 place count 5470 transition count 5111
Iterating global reduction 3 with 50 rules applied. Total rules applied 7094 place count 5470 transition count 5111
Applied a total of 7094 rules in 13274 ms. Remains 5470 /9349 variables (removed 3879) and now considering 5111/8726 (removed 3615) transitions.
// Phase 1: matrix 5111 rows 5470 cols
[2024-05-25 08:36:13] [INFO ] Computed 717 invariants in 79 ms
[2024-05-25 08:36:16] [INFO ] Implicit Places using invariants in 2789 ms returned [3326, 3837, 3838, 3839, 3840, 3841, 3842, 3843, 3844, 3845, 3846, 3847, 3848, 3849, 3850, 3851, 3852, 3853, 3854, 3855, 3856, 3857, 3858, 3859, 3860, 3861, 3862, 3863, 3864, 3865, 3866, 3867, 3868, 3869, 3870, 3871, 3872, 3873, 3874, 3875, 3876, 3877, 3878, 3879, 3880, 3881, 3882, 3883, 3884, 3885, 3886, 3887, 4857]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 2794 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5417/9349 places, 5111/8726 transitions.
Applied a total of 0 rules in 726 ms. Remains 5417 /5417 variables (removed 0) and now considering 5111/5111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16796 ms. Remains : 5417/9349 places, 5111/8726 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 2738 ms.
Product exploration explored 100000 steps with 50000 reset in 2780 ms.
Computed a total of 5417 stabilizing places and 5111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5417 transition count 5111
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 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 finished in 25203 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 103 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7663 transition count 7958
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7663 transition count 7958
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 2512 place count 7605 transition count 7550
Iterating global reduction 1 with 58 rules applied. Total rules applied 2570 place count 7605 transition count 7550
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2621 place count 7554 transition count 7550
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3028 place count 7147 transition count 7143
Iterating global reduction 2 with 407 rules applied. Total rules applied 3435 place count 7147 transition count 7143
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3842 place count 6740 transition count 6686
Iterating global reduction 2 with 407 rules applied. Total rules applied 4249 place count 6740 transition count 6686
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4504 place count 6485 transition count 6431
Iterating global reduction 2 with 255 rules applied. Total rules applied 4759 place count 6485 transition count 6431
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5014 place count 6230 transition count 6176
Iterating global reduction 2 with 255 rules applied. Total rules applied 5269 place count 6230 transition count 6176
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5524 place count 5975 transition count 5921
Iterating global reduction 2 with 255 rules applied. Total rules applied 5779 place count 5975 transition count 5921
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6034 place count 5720 transition count 5666
Iterating global reduction 2 with 255 rules applied. Total rules applied 6289 place count 5720 transition count 5666
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6544 place count 5465 transition count 5411
Iterating global reduction 2 with 255 rules applied. Total rules applied 6799 place count 5465 transition count 5411
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7054 place count 5210 transition count 5156
Iterating global reduction 2 with 255 rules applied. Total rules applied 7309 place count 5210 transition count 5156
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7564 place count 4955 transition count 4901
Iterating global reduction 2 with 255 rules applied. Total rules applied 7819 place count 4955 transition count 4901
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8074 place count 4700 transition count 4646
Iterating global reduction 2 with 255 rules applied. Total rules applied 8329 place count 4700 transition count 4646
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8584 place count 4445 transition count 4391
Iterating global reduction 2 with 255 rules applied. Total rules applied 8839 place count 4445 transition count 4391
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9094 place count 4190 transition count 4136
Iterating global reduction 2 with 255 rules applied. Total rules applied 9349 place count 4190 transition count 4136
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9604 place count 3935 transition count 3881
Iterating global reduction 2 with 255 rules applied. Total rules applied 9859 place count 3935 transition count 3881
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 10114 place count 3935 transition count 3626
Applied a total of 10114 rules in 17355 ms. Remains 3935 /9349 variables (removed 5414) and now considering 3626/8726 (removed 5100) transitions.
// Phase 1: matrix 3626 rows 3935 cols
[2024-05-25 08:36:42] [INFO ] Computed 412 invariants in 60 ms
[2024-05-25 08:36:44] [INFO ] Implicit Places using invariants in 2100 ms returned [1791, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2346, 2347, 2348, 2349, 2350, 2351, 2352, 3322]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 2127 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3882/9349 places, 3626/8726 transitions.
Applied a total of 0 rules in 642 ms. Remains 3882 /3882 variables (removed 0) and now considering 3626/3626 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20132 ms. Remains : 3882/9349 places, 3626/8726 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 finished in 20248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 255 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 666 places :
Symmetric choice reduction at 1 with 666 rule applications. Total rules 1584 place count 7765 transition count 8060
Iterating global reduction 1 with 666 rules applied. Total rules applied 2250 place count 7765 transition count 8060
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 2308 place count 7707 transition count 7652
Iterating global reduction 1 with 58 rules applied. Total rules applied 2366 place count 7707 transition count 7652
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2417 place count 7656 transition count 7652
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 2722 place count 7351 transition count 7347
Iterating global reduction 2 with 305 rules applied. Total rules applied 3027 place count 7351 transition count 7347
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 3332 place count 7046 transition count 6992
Iterating global reduction 2 with 305 rules applied. Total rules applied 3637 place count 7046 transition count 6992
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 3942 place count 6741 transition count 6687
Iterating global reduction 2 with 305 rules applied. Total rules applied 4247 place count 6741 transition count 6687
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 4552 place count 6436 transition count 6382
Iterating global reduction 2 with 305 rules applied. Total rules applied 4857 place count 6436 transition count 6382
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5162 place count 6131 transition count 6077
Iterating global reduction 2 with 305 rules applied. Total rules applied 5467 place count 6131 transition count 6077
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5772 place count 5826 transition count 5772
Iterating global reduction 2 with 305 rules applied. Total rules applied 6077 place count 5826 transition count 5772
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6078 place count 5825 transition count 5772
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 6383 place count 5520 transition count 5467
Iterating global reduction 3 with 305 rules applied. Total rules applied 6688 place count 5520 transition count 5467
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 6993 place count 5215 transition count 5162
Iterating global reduction 3 with 305 rules applied. Total rules applied 7298 place count 5215 transition count 5162
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7553 place count 4960 transition count 4907
Iterating global reduction 3 with 255 rules applied. Total rules applied 7808 place count 4960 transition count 4907
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8063 place count 4705 transition count 4652
Iterating global reduction 3 with 255 rules applied. Total rules applied 8318 place count 4705 transition count 4652
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8573 place count 4450 transition count 4397
Iterating global reduction 3 with 255 rules applied. Total rules applied 8828 place count 4450 transition count 4397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9083 place count 4195 transition count 4142
Iterating global reduction 3 with 255 rules applied. Total rules applied 9338 place count 4195 transition count 4142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9593 place count 3940 transition count 3887
Iterating global reduction 3 with 255 rules applied. Total rules applied 9848 place count 3940 transition count 3887
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 10103 place count 3940 transition count 3632
Applied a total of 10103 rules in 16682 ms. Remains 3940 /9349 variables (removed 5409) and now considering 3632/8726 (removed 5094) transitions.
// Phase 1: matrix 3632 rows 3940 cols
[2024-05-25 08:37:02] [INFO ] Computed 411 invariants in 66 ms
[2024-05-25 08:37:04] [INFO ] Implicit Places using invariants in 2132 ms returned [1490, 3327]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2140 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3938/9349 places, 3632/8726 transitions.
Applied a total of 0 rules in 422 ms. Remains 3938 /3938 variables (removed 0) and now considering 3632/3632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19244 ms. Remains : 3938/9349 places, 3632/8726 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 1477 ms.
Product exploration explored 100000 steps with 33333 reset in 1033 ms.
Computed a total of 3938 stabilizing places and 3632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3938 transition count 3632
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) p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 26 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 finished in 23687 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(X(X(G((X(!p0) U p1)))))))'
Support contains 765 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8737 transition count 8726
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1380 place count 7969 transition count 7958
Iterating global reduction 1 with 768 rules applied. Total rules applied 2148 place count 7969 transition count 7958
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 2206 place count 7911 transition count 7550
Iterating global reduction 1 with 58 rules applied. Total rules applied 2264 place count 7911 transition count 7550
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2315 place count 7860 transition count 7550
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 2722 place count 7453 transition count 7143
Iterating global reduction 2 with 407 rules applied. Total rules applied 3129 place count 7453 transition count 7143
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3536 place count 7046 transition count 6686
Iterating global reduction 2 with 407 rules applied. Total rules applied 3943 place count 7046 transition count 6686
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 4248 place count 6741 transition count 6381
Iterating global reduction 2 with 305 rules applied. Total rules applied 4553 place count 6741 transition count 6381
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 4603 place count 6691 transition count 6331
Iterating global reduction 2 with 50 rules applied. Total rules applied 4653 place count 6691 transition count 6331
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 4703 place count 6641 transition count 6281
Iterating global reduction 2 with 50 rules applied. Total rules applied 4753 place count 6641 transition count 6281
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 4803 place count 6591 transition count 6231
Iterating global reduction 2 with 50 rules applied. Total rules applied 4853 place count 6591 transition count 6231
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 4854 place count 6590 transition count 6231
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 4904 place count 6540 transition count 6181
Iterating global reduction 3 with 50 rules applied. Total rules applied 4954 place count 6540 transition count 6181
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 5004 place count 6490 transition count 6131
Iterating global reduction 3 with 50 rules applied. Total rules applied 5054 place count 6490 transition count 6131
Applied a total of 5054 rules in 14538 ms. Remains 6490 /9349 variables (removed 2859) and now considering 6131/8726 (removed 2595) transitions.
// Phase 1: matrix 6131 rows 6490 cols
[2024-05-25 08:37:23] [INFO ] Computed 717 invariants in 88 ms
[2024-05-25 08:37:26] [INFO ] Implicit Places using invariants in 2845 ms returned [4346, 4857, 4858, 4859, 4860, 4861, 4862, 4863, 4864, 4865, 4866, 4867, 4868, 4869, 4870, 4871, 4872, 4873, 4874, 4875, 4876, 4877, 4878, 4879, 4880, 4881, 4882, 4883, 4884, 4885, 4886, 4887, 4888, 4889, 4890, 4891, 4892, 4893, 4894, 4895, 4896, 4897, 4898, 4899, 4900, 4901, 4902, 4903, 4904, 4905, 4906, 4907, 5877]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 2857 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6437/9349 places, 6131/8726 transitions.
Applied a total of 0 rules in 1120 ms. Remains 6437 /6437 variables (removed 0) and now considering 6131/6131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18516 ms. Remains : 6437/9349 places, 6131/8726 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09
Product exploration explored 100000 steps with 371 reset in 3186 ms.
Product exploration explored 100000 steps with 375 reset in 2894 ms.
Computed a total of 6437 stabilizing places and 6131 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6437 transition count 6131
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 p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 15924 steps (4 resets) in 600 ms. (26 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 finished in 28386 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((!(X(G(X(p0))) U p1)||!(p2 U p3)||F(!p2))))'
Support contains 412 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 510 places :
Symmetric choice reduction at 1 with 510 rule applications. Total rules 1428 place count 7921 transition count 8216
Iterating global reduction 1 with 510 rules applied. Total rules applied 1938 place count 7921 transition count 8216
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 1991 place count 7868 transition count 8063
Iterating global reduction 1 with 53 rules applied. Total rules applied 2044 place count 7868 transition count 8063
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2095 place count 7817 transition count 8063
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 2247 place count 7665 transition count 7911
Iterating global reduction 2 with 152 rules applied. Total rules applied 2399 place count 7665 transition count 7911
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 2449 place count 7615 transition count 7811
Iterating global reduction 2 with 50 rules applied. Total rules applied 2499 place count 7615 transition count 7811
Applied a total of 2499 rules in 8915 ms. Remains 7615 /9349 variables (removed 1734) and now considering 7811/8726 (removed 915) transitions.
// Phase 1: matrix 7811 rows 7615 cols
[2024-05-25 08:37:46] [INFO ] Computed 412 invariants in 178 ms
[2024-05-25 08:37:49] [INFO ] Implicit Places using invariants in 3090 ms returned [5877, 5878, 5879, 5880, 5881, 5882, 5883, 5884, 5885, 5886, 5887, 5888, 5889, 5890, 5891, 5892, 5893, 5894, 5895, 5896, 5897, 5898, 5899, 5900, 5901, 5902, 5903, 5904, 5905, 5906, 5907, 5908, 5909, 5910, 5911, 5912, 5913, 5914, 5915, 5916, 5917, 5918, 5919, 5920, 5921, 5922, 5923, 5924, 5925, 5926, 5927, 7002]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 3098 ms to find 52 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7563/9349 places, 7811/8726 transitions.
Applied a total of 0 rules in 1768 ms. Remains 7563 /7563 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13783 ms. Remains : 7563/9349 places, 7811/8726 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND p1 p2 p3), p2, (AND p2 p3 (NOT p1)), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
Product exploration explored 100000 steps with 36 reset in 3875 ms.
Product exploration explored 100000 steps with 36 reset in 3672 ms.
Computed a total of 7563 stabilizing places and 7811 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7563 transition count 7811
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 p3) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 26 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 finished in 25420 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(!p1) U (!p2&&G(!p1))))||p0) U p3))'
Support contains 255 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 717 places :
Symmetric choice reduction at 1 with 717 rule applications. Total rules 1635 place count 7714 transition count 8009
Iterating global reduction 1 with 717 rules applied. Total rules applied 2352 place count 7714 transition count 8009
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 2359 place count 7707 transition count 7652
Iterating global reduction 1 with 7 rules applied. Total rules applied 2366 place count 7707 transition count 7652
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2417 place count 7656 transition count 7652
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2774 place count 7299 transition count 7295
Iterating global reduction 2 with 357 rules applied. Total rules applied 3131 place count 7299 transition count 7295
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3386 place count 7044 transition count 7040
Iterating global reduction 2 with 255 rules applied. Total rules applied 3641 place count 7044 transition count 7040
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3896 place count 6789 transition count 6785
Iterating global reduction 2 with 255 rules applied. Total rules applied 4151 place count 6789 transition count 6785
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4406 place count 6534 transition count 6530
Iterating global reduction 2 with 255 rules applied. Total rules applied 4661 place count 6534 transition count 6530
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4916 place count 6279 transition count 6275
Iterating global reduction 2 with 255 rules applied. Total rules applied 5171 place count 6279 transition count 6275
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5426 place count 6024 transition count 6020
Iterating global reduction 2 with 255 rules applied. Total rules applied 5681 place count 6024 transition count 6020
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5936 place count 5769 transition count 5765
Iterating global reduction 2 with 255 rules applied. Total rules applied 6191 place count 5769 transition count 5765
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6446 place count 5514 transition count 5510
Iterating global reduction 2 with 255 rules applied. Total rules applied 6701 place count 5514 transition count 5510
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6956 place count 5259 transition count 5255
Iterating global reduction 2 with 255 rules applied. Total rules applied 7211 place count 5259 transition count 5255
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7466 place count 5004 transition count 5000
Iterating global reduction 2 with 255 rules applied. Total rules applied 7721 place count 5004 transition count 5000
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7976 place count 4749 transition count 4745
Iterating global reduction 2 with 255 rules applied. Total rules applied 8231 place count 4749 transition count 4745
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8486 place count 4494 transition count 4490
Iterating global reduction 2 with 255 rules applied. Total rules applied 8741 place count 4494 transition count 4490
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8996 place count 4239 transition count 4235
Iterating global reduction 2 with 255 rules applied. Total rules applied 9251 place count 4239 transition count 4235
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 9506 place count 4239 transition count 3980
Applied a total of 9506 rules in 18446 ms. Remains 4239 /9349 variables (removed 5110) and now considering 3980/8726 (removed 4746) transitions.
// Phase 1: matrix 3980 rows 4239 cols
[2024-05-25 08:38:21] [INFO ] Computed 412 invariants in 51 ms
[2024-05-25 08:38:24] [INFO ] Implicit Places using invariants in 2737 ms returned [1582, 1942, 2504, 2505, 2506, 2507, 2508, 2509, 2510, 2511, 2512, 2513, 2514, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544, 2545, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 3626]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 2740 ms to find 54 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4185/9349 places, 3980/8726 transitions.
Applied a total of 0 rules in 471 ms. Remains 4185 /4185 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21659 ms. Remains : 4185/9349 places, 3980/8726 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p3), (OR p2 p1), true, p1]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 finished in 21869 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 51 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8431 transition count 8726
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7663 transition count 7958
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7663 transition count 7958
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 2512 place count 7605 transition count 7550
Iterating global reduction 1 with 58 rules applied. Total rules applied 2570 place count 7605 transition count 7550
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2621 place count 7554 transition count 7550
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3028 place count 7147 transition count 7143
Iterating global reduction 2 with 407 rules applied. Total rules applied 3435 place count 7147 transition count 7143
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 3842 place count 6740 transition count 6686
Iterating global reduction 2 with 407 rules applied. Total rules applied 4249 place count 6740 transition count 6686
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 4554 place count 6435 transition count 6381
Iterating global reduction 2 with 305 rules applied. Total rules applied 4859 place count 6435 transition count 6381
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5164 place count 6130 transition count 6076
Iterating global reduction 2 with 305 rules applied. Total rules applied 5469 place count 6130 transition count 6076
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 5774 place count 5825 transition count 5771
Iterating global reduction 2 with 305 rules applied. Total rules applied 6079 place count 5825 transition count 5771
Discarding 305 places :
Symmetric choice reduction at 2 with 305 rule applications. Total rules 6384 place count 5520 transition count 5466
Iterating global reduction 2 with 305 rules applied. Total rules applied 6689 place count 5520 transition count 5466
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6690 place count 5519 transition count 5466
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 6995 place count 5214 transition count 5161
Iterating global reduction 3 with 305 rules applied. Total rules applied 7300 place count 5214 transition count 5161
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 7605 place count 4909 transition count 4856
Iterating global reduction 3 with 305 rules applied. Total rules applied 7910 place count 4909 transition count 4856
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8165 place count 4654 transition count 4601
Iterating global reduction 3 with 255 rules applied. Total rules applied 8420 place count 4654 transition count 4601
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8675 place count 4399 transition count 4346
Iterating global reduction 3 with 255 rules applied. Total rules applied 8930 place count 4399 transition count 4346
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9185 place count 4144 transition count 4091
Iterating global reduction 3 with 255 rules applied. Total rules applied 9440 place count 4144 transition count 4091
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9695 place count 3889 transition count 3836
Iterating global reduction 3 with 255 rules applied. Total rules applied 9950 place count 3889 transition count 3836
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 10205 place count 3634 transition count 3581
Iterating global reduction 3 with 255 rules applied. Total rules applied 10460 place count 3634 transition count 3581
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 10715 place count 3634 transition count 3326
Applied a total of 10715 rules in 16852 ms. Remains 3634 /9349 variables (removed 5715) and now considering 3326/8726 (removed 5400) transitions.
// Phase 1: matrix 3326 rows 3634 cols
[2024-05-25 08:38:41] [INFO ] Computed 411 invariants in 32 ms
[2024-05-25 08:38:43] [INFO ] Implicit Places using invariants in 1500 ms returned [1490, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 2050, 2051, 3021]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 1509 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3581/9349 places, 3326/8726 transitions.
Applied a total of 0 rules in 368 ms. Remains 3581 /3581 variables (removed 0) and now considering 3326/3326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18732 ms. Remains : 3581/9349 places, 3326/8726 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14
Product exploration explored 100000 steps with 69 reset in 1005 ms.
Product exploration explored 100000 steps with 68 reset in 861 ms.
Computed a total of 3581 stabilizing places and 3326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3581 transition count 3326
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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6020 steps (0 resets) in 81 ms. (73 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 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3326 rows 3581 cols
[2024-05-25 08:38:47] [INFO ] Computed 358 invariants in 39 ms
[2024-05-25 08:38:51] [INFO ] [Real]Absence check using 0 positive and 358 generalized place invariants in 388 ms returned sat
[2024-05-25 08:38:58] [INFO ] [Real]Absence check using state equation in 6856 ms returned sat
[2024-05-25 08:38:59] [INFO ] Computed and/alt/rep : 3273/3733/3273 causal constraints (skipped 2 transitions) in 234 ms.
[2024-05-25 08:39:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:39:07] [INFO ] [Nat]Absence check using 0 positive and 358 generalized place invariants in 442 ms returned sat
[2024-05-25 08:39:17] [INFO ] [Nat]Absence check using state equation in 9685 ms returned unknown
Could not prove EG (NOT p0)
Support contains 51 out of 3581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3581/3581 places, 3326/3326 transitions.
Graph (complete) has 4091 edges and 3581 vertex of which 2754 are kept as prefixes of interest. Removing 827 places using SCC suffix rule.4 ms
Discarding 827 places :
Also discarding 623 output transitions
Drop transitions (Output transitions of discarded places.) removed 623 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1836 transitions
Trivial Post-agglo rules discarded 1836 transitions
Performed 1836 trivial Post agglomeration. Transition count delta: 1836
Iterating post reduction 0 with 1836 rules applied. Total rules applied 1837 place count 2703 transition count 816
Reduce places removed 1836 places and 0 transitions.
Iterating post reduction 1 with 1836 rules applied. Total rules applied 3673 place count 867 transition count 816
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 459 Pre rules applied. Total rules applied 3673 place count 867 transition count 357
Deduced a syphon composed of 459 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 2 with 1071 rules applied. Total rules applied 4744 place count 255 transition count 357
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 4846 place count 153 transition count 255
Iterating global reduction 2 with 102 rules applied. Total rules applied 4948 place count 153 transition count 255
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 5050 place count 153 transition count 153
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 5050 place count 153 transition count 102
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 5152 place count 102 transition count 102
Applied a total of 5152 rules in 68 ms. Remains 102 /3581 variables (removed 3479) and now considering 102/3326 (removed 3224) transitions.
// Phase 1: matrix 102 rows 102 cols
[2024-05-25 08:39:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 08:39:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 08:39:17] [INFO ] Invariant cache hit.
[2024-05-25 08:39:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-25 08:39:17] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-25 08:39:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 102/153 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 51/204 variables, 51/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 102 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1208 ms.
Refiners :[State Equation: 102/102 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 102/153 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 51/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 51/204 variables, 51/153 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 153 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1180 ms.
Refiners :[State Equation: 102/102 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 2418ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/3581 places, 102/3326 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2640 ms. Remains : 102/3581 places, 102/3326 transitions.
Computed a total of 102 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 102
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 25 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 finished in 55411 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)) U p2))'
Support contains 306 out of 9349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Graph (complete) has 12649 edges and 9349 vertex of which 8883 are kept as prefixes of interest. Removing 466 places using SCC suffix rule.19 ms
Discarding 466 places :
Also discarding 515 output transitions
Drop transitions (Output transitions of discarded places.) removed 515 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5151 transitions
Trivial Post-agglo rules discarded 5151 transitions
Performed 5151 trivial Post agglomeration. Transition count delta: 5151
Iterating post reduction 0 with 6069 rules applied. Total rules applied 6070 place count 7914 transition count 3009
Reduce places removed 5151 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 5304 rules applied. Total rules applied 11374 place count 2763 transition count 2856
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 11527 place count 2610 transition count 2856
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 867 Pre rules applied. Total rules applied 11527 place count 2610 transition count 1989
Deduced a syphon composed of 867 places in 1 ms
Ensure Unique test removed 357 places
Reduce places removed 1224 places and 0 transitions.
Iterating global reduction 3 with 2091 rules applied. Total rules applied 13618 place count 1386 transition count 1989
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 51 rules applied. Total rules applied 13669 place count 1386 transition count 1938
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 13720 place count 1335 transition count 1938
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 13720 place count 1335 transition count 1887
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 13822 place count 1284 transition count 1887
Discarding 362 places :
Symmetric choice reduction at 5 with 362 rule applications. Total rules 14184 place count 922 transition count 1275
Iterating global reduction 5 with 362 rules applied. Total rules applied 14546 place count 922 transition count 1275
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 5 with 255 rules applied. Total rules applied 14801 place count 922 transition count 1020
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 102 Pre rules applied. Total rules applied 14801 place count 922 transition count 918
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 15005 place count 820 transition count 918
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 15007 place count 818 transition count 816
Iterating global reduction 6 with 2 rules applied. Total rules applied 15009 place count 818 transition count 816
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 6 with 51 rules applied. Total rules applied 15060 place count 767 transition count 816
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 15060 place count 767 transition count 765
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 15162 place count 716 transition count 765
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 15213 place count 665 transition count 714
Applied a total of 15213 rules in 655 ms. Remains 665 /9349 variables (removed 8684) and now considering 714/8726 (removed 8012) transitions.
// Phase 1: matrix 714 rows 665 cols
[2024-05-25 08:39:20] [INFO ] Computed 53 invariants in 8 ms
[2024-05-25 08:39:21] [INFO ] Implicit Places using invariants in 402 ms returned [102, 562]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 404 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 663/9349 places, 714/8726 transitions.
Reduce places removed 51 places and 51 transitions.
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 51 Pre rules applied. Total rules applied 0 place count 612 transition count 612
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 561 transition count 612
Applied a total of 102 rules in 26 ms. Remains 561 /663 variables (removed 102) and now considering 612/714 (removed 102) transitions.
// Phase 1: matrix 612 rows 561 cols
[2024-05-25 08:39:21] [INFO ] Computed 51 invariants in 3 ms
[2024-05-25 08:39:21] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-25 08:39:21] [INFO ] Invariant cache hit.
[2024-05-25 08:39:22] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 561/9349 places, 612/8726 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1942 ms. Remains : 561/9349 places, 612/8726 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), true, p0, p1]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 finished in 2116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 357 out of 9349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9349/9349 places, 8726/8726 transitions.
Graph (complete) has 12649 edges and 9349 vertex of which 7914 are kept as prefixes of interest. Removing 1435 places using SCC suffix rule.19 ms
Discarding 1435 places :
Also discarding 1280 output transitions
Drop transitions (Output transitions of discarded places.) removed 1280 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4947 transitions
Trivial Post-agglo rules discarded 4947 transitions
Performed 4947 trivial Post agglomeration. Transition count delta: 4947
Iterating post reduction 0 with 5865 rules applied. Total rules applied 5866 place count 6945 transition count 2448
Reduce places removed 4947 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 5100 rules applied. Total rules applied 10966 place count 1998 transition count 2295
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 11119 place count 1845 transition count 2295
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 357 Pre rules applied. Total rules applied 11119 place count 1845 transition count 1938
Deduced a syphon composed of 357 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 867 rules applied. Total rules applied 11986 place count 1335 transition count 1938
Discarding 362 places :
Symmetric choice reduction at 3 with 362 rule applications. Total rules 12348 place count 973 transition count 1326
Iterating global reduction 3 with 362 rules applied. Total rules applied 12710 place count 973 transition count 1326
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 306 rules applied. Total rules applied 13016 place count 973 transition count 1020
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 13067 place count 922 transition count 1020
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 13067 place count 922 transition count 918
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 13271 place count 820 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 13373 place count 769 transition count 867
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 13424 place count 718 transition count 816
Applied a total of 13424 rules in 474 ms. Remains 718 /9349 variables (removed 8631) and now considering 816/8726 (removed 7910) transitions.
// Phase 1: matrix 816 rows 718 cols
[2024-05-25 08:39:23] [INFO ] Computed 104 invariants in 15 ms
[2024-05-25 08:39:23] [INFO ] Implicit Places using invariants in 768 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 771 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 666/9349 places, 816/8726 transitions.
Applied a total of 0 rules in 12 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1258 ms. Remains : 666/9349 places, 816/8726 transitions.
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
Product exploration explored 100000 steps with 325 reset in 1711 ms.
Product exploration explored 100000 steps with 325 reset in 1535 ms.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
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) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 413 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1148 steps (0 resets) in 32 ms. (34 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 560 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 816 rows 666 cols
[2024-05-25 08:39:29] [INFO ] Computed 52 invariants in 11 ms
[2024-05-25 08:39:32] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 55 ms returned sat
[2024-05-25 08:39:33] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2024-05-25 08:39:33] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 93 ms.
[2024-05-25 08:39:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:39:38] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 29 ms returned sat
[2024-05-25 08:39:38] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-05-25 08:39:39] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 95 ms.
[2024-05-25 08:39:41] [INFO ] Added : 192 causal constraints over 39 iterations in 2912 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 14 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-25 08:39:41] [INFO ] Invariant cache hit.
[2024-05-25 08:39:42] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-25 08:39:42] [INFO ] Invariant cache hit.
[2024-05-25 08:39:43] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
[2024-05-25 08:39:43] [INFO ] Redundant transitions in 11 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-25 08:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62223 ms. Remains : 666/666 places, 816/816 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
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) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 298 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1119 steps (0 resets) in 31 ms. (34 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 559 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-25 08:40:46] [INFO ] Invariant cache hit.
[2024-05-25 08:40:49] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 54 ms returned sat
[2024-05-25 08:40:50] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2024-05-25 08:40:50] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 72 ms.
[2024-05-25 08:40:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:40:54] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 42 ms returned sat
[2024-05-25 08:40:55] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2024-05-25 08:40:55] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 64 ms.
[2024-05-25 08:40:58] [INFO ] Added : 189 causal constraints over 38 iterations in 2708 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1487 ms.
Product exploration explored 100000 steps with 325 reset in 1498 ms.
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 10 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-25 08:41:01] [INFO ] Invariant cache hit.
[2024-05-25 08:41:02] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-25 08:41:02] [INFO ] Invariant cache hit.
[2024-05-25 08:41:02] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2024-05-25 08:41:02] [INFO ] Redundant transitions in 7 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-25 08:41:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61430 ms. Remains : 666/666 places, 816/816 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 finished in 161199 ms.
[2024-05-25 08:42:04] [INFO ] Flatten gal took : 623 ms
[2024-05-25 08:42:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2024-05-25 08:42:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9349 places, 8726 transitions and 21579 arcs took 339 ms.
Total runtime 754293 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FamilyReunion-COL-L00050M0005C002P002G001

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 9349
TRANSITIONS: 8726
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.317s, Sys 0.028s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.073s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1543
MODEL NAME: /home/mcc/execution/415/model
9349 places, 8726 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, 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 r157-smll-171636265700404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 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 ;