Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654406800052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ParamProductionCell-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406800052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716654629010

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 16:30:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:30:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:30:31] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-25 16:30:31] [INFO ] Transformed 231 places.
[2024-05-25 16:30:31] [INFO ] Transformed 202 transitions.
[2024-05-25 16:30:31] [INFO ] Found NUPN structural information;
[2024-05-25 16:30:31] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 100 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2024-05-25 16:30:32] [INFO ] Computed 59 invariants in 29 ms
[2024-05-25 16:30:32] [INFO ] Implicit Places using invariants in 680 ms returned [15, 16, 18, 31, 35, 36, 41, 46, 47, 59, 64, 73, 79, 101, 114, 116, 118, 119, 159, 162, 190, 191, 194, 195, 200, 201, 216]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 748 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 196/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 892 ms. Remains : 198/231 places, 196/202 transitions.
Support contains 51 out of 198 places after structural reductions.
[2024-05-25 16:30:32] [INFO ] Flatten gal took : 72 ms
[2024-05-25 16:30:33] [INFO ] Flatten gal took : 29 ms
[2024-05-25 16:30:33] [INFO ] Input system was already deterministic with 196 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 1836 ms. (21 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40001 steps (8 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
// Phase 1: matrix 196 rows 198 cols
[2024-05-25 16:30:33] [INFO ] Computed 32 invariants in 7 ms
[2024-05-25 16:30:33] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 109/394 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 7/23 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/198 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ParamProductionCell-PT-5-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(!p1 U (p2||G(!p1)))))'
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 20 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-25 16:30:34] [INFO ] Invariant cache hit.
[2024-05-25 16:30:34] [INFO ] Implicit Places using invariants in 299 ms returned [16, 21, 35, 54, 66, 85, 99, 144, 145, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 303 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 21 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 16:30:34] [INFO ] Computed 22 invariants in 4 ms
[2024-05-25 16:30:34] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-25 16:30:34] [INFO ] Invariant cache hit.
[2024-05-25 16:30:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:30:35] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1145 ms. Remains : 186/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-00 finished in 1693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 50 place count 173 transition count 158
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 76 place count 160 transition count 158
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 130 place count 133 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 132 transition count 130
Applied a total of 132 rules in 77 ms. Remains 132 /198 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 132 cols
[2024-05-25 16:30:36] [INFO ] Computed 32 invariants in 3 ms
[2024-05-25 16:30:36] [INFO ] Implicit Places using invariants in 196 ms returned [9, 12, 22, 34, 41, 51, 52, 64, 95, 98, 99, 122]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 199 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 130/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 127
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 90 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 89 transition count 99
Applied a total of 62 rules in 40 ms. Remains 89 /120 variables (removed 31) and now considering 99/130 (removed 31) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-05-25 16:30:36] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 16:30:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-25 16:30:36] [INFO ] Invariant cache hit.
[2024-05-25 16:30:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 16:30:36] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/198 places, 99/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 648 ms. Remains : 89/198 places, 99/196 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), true, p0]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 862 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)||G(!p1)) U p1))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 159 transition count 157
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 128 place count 134 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 133 transition count 131
Applied a total of 130 rules in 32 ms. Remains 133 /198 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 133 cols
[2024-05-25 16:30:36] [INFO ] Computed 32 invariants in 4 ms
[2024-05-25 16:30:37] [INFO ] Implicit Places using invariants in 169 ms returned [8, 11, 21, 33, 40, 50, 64, 95, 98, 99, 123]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 176 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 131/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 120 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 120 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 117 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 117 transition count 126
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 36 place count 104 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 103 transition count 112
Applied a total of 38 rules in 34 ms. Remains 103 /122 variables (removed 19) and now considering 112/131 (removed 19) transitions.
// Phase 1: matrix 112 rows 103 cols
[2024-05-25 16:30:37] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:30:37] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-25 16:30:37] [INFO ] Invariant cache hit.
[2024-05-25 16:30:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 16:30:37] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/198 places, 112/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 657 ms. Remains : 103/198 places, 112/196 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-04
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-04 finished in 813 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(X(F(p0)))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-25 16:30:37] [INFO ] Computed 32 invariants in 2 ms
[2024-05-25 16:30:37] [INFO ] Implicit Places using invariants in 179 ms returned [16, 21, 35, 54, 66, 85, 86, 99, 141, 144, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 187 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 8 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:30:37] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:30:38] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 16:30:38] [INFO ] Invariant cache hit.
[2024-05-25 16:30:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:30:38] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 673 ms. Remains : 185/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07
Product exploration explored 100000 steps with 1429 reset in 564 ms.
Product exploration explored 100000 steps with 1426 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 244 steps (0 resets) in 8 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 16:30:40] [INFO ] Invariant cache hit.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-25 16:30:41] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-25 16:30:41] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-05-25 16:30:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:30:41] [INFO ] [Nat]Added 68 Read/Feed constraints in 70 ms returned sat
[2024-05-25 16:30:41] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 8 ms to minimize.
[2024-05-25 16:30:41] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-25 16:30:42] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-25 16:30:42] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 3 ms to minimize.
[2024-05-25 16:30:42] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-05-25 16:30:42] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-25 16:30:42] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 4 ms to minimize.
[2024-05-25 16:30:42] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 3 ms to minimize.
[2024-05-25 16:30:43] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 4 ms to minimize.
[2024-05-25 16:30:43] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-25 16:30:43] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:30:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1690 ms
[2024-05-25 16:30:43] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-25 16:30:45] [INFO ] Added : 164 causal constraints over 33 iterations in 1756 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 16:30:45] [INFO ] Invariant cache hit.
[2024-05-25 16:30:45] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 16:30:45] [INFO ] Invariant cache hit.
[2024-05-25 16:30:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:30:45] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-25 16:30:45] [INFO ] Invariant cache hit.
[2024-05-25 16:30:45] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:30:47] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-25 16:30:47] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-25 16:30:47] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-25 16:30:47] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:30:48] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-25 16:30:49] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 2 ms to minimize.
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:30:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:30:52] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:30:52] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 5/184 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-25 16:30:55] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:30:56] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 4 ms to minimize.
[2024-05-25 16:30:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:30:56] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:30:56] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:30:56] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:30:56] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-25 16:30:57] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:30:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-25 16:30:57] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 19/68 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:30:58] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-25 16:30:58] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:31:01] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:31:03] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 326 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:31:20] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 189/516 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-25 16:31:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:31:26] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:31:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 519 constraints, problems are : Problem set: 0 solved, 189 unsolved in 26641 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 56/56 constraints]
After SMT, in 56774ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 56784ms
Finished structural reductions in LTL mode , in 1 iterations and 57573 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 307 steps (0 resets) in 6 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-25 16:31:43] [INFO ] Invariant cache hit.
[2024-05-25 16:31:43] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-25 16:31:43] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:31:43] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-05-25 16:31:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-25 16:31:44] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-25 16:31:44] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2024-05-25 16:31:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:31:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 66 ms returned sat
[2024-05-25 16:31:44] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-25 16:31:44] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-25 16:31:44] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:31:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1281 ms
[2024-05-25 16:31:45] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-25 16:31:47] [INFO ] Added : 164 causal constraints over 33 iterations in 1534 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1434 reset in 221 ms.
Product exploration explored 100000 steps with 1432 reset in 263 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 37 place count 185 transition count 196
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 185 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 177 transition count 187
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 177 transition count 187
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 107 place count 177 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 152 transition count 162
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 157 rules in 47 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2024-05-25 16:31:48] [INFO ] Redundant transitions in 9 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 152 cols
[2024-05-25 16:31:48] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:31:48] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-25 16:31:50] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 3 ms to minimize.
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 18/34 constraints. Problems are: Problem set: 44 solved, 115 unsolved
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:31:52] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:31:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:31:52] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-25 16:31:52] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 5/39 constraints. Problems are: Problem set: 44 solved, 115 unsolved
[2024-05-25 16:31:53] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/40 constraints. Problems are: Problem set: 44 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/40 constraints. Problems are: Problem set: 44 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 3/151 variables, 3/43 constraints. Problems are: Problem set: 44 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/44 constraints. Problems are: Problem set: 44 solved, 115 unsolved
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:31:55] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 3 ms to minimize.
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 20/64 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:31:56] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:31:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-25 16:31:57] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 3/67 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/67 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/68 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:31:59] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/69 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/69 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 162/314 variables, 152/221 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 68/289 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 0/289 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/314 variables, 0/289 constraints. Problems are: Problem set: 59 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 289 constraints, problems are : Problem set: 59 solved, 100 unsolved in 15536 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 59 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 10/10 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 36/46 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/46 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 61/151 variables, 8/54 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/56 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 12/68 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/68 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/69 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:32:06] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 3 ms to minimize.
[2024-05-25 16:32:06] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 2/71 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 162/314 variables, 152/223 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 68/291 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 100/391 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:32:09] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 1/392 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:32:12] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 1/393 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/393 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:32:17] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/314 variables, 1/394 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:32:19] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/314 variables, 1/395 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/314 variables, 0/395 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-05-25 16:32:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/314 variables, 1/396 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/396 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 21 (OVERLAPS) 0/314 variables, 0/396 constraints. Problems are: Problem set: 59 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 396 constraints, problems are : Problem set: 59 solved, 100 unsolved in 25155 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 100/159 constraints, Known Traps: 55/55 constraints]
After SMT, in 40753ms problems are : Problem set: 59 solved, 100 unsolved
Search for dead transitions found 59 dead transitions in 40759ms
Found 59 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 59 transitions
Dead transitions reduction (with SMT) removed 59 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 103/194 transitions.
Graph (complete) has 310 edges and 152 vertex of which 94 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.3 ms
Discarding 58 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 94 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 94 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 10 ms. Remains 94 /152 variables (removed 58) and now considering 103/103 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/185 places, 103/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40833 ms. Remains : 94/185 places, 103/194 transitions.
Built C files in :
/tmp/ltsmin1873130820753413993
[2024-05-25 16:32:29] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1873130820753413993
Running compilation step : cd /tmp/ltsmin1873130820753413993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin1873130820753413993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin1873130820753413993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11582721987380552043.hoa' '--buchi-type=spotba'
LTSmin run took 3162 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 115911 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&&F(G(p1))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-25 16:32:33] [INFO ] Computed 32 invariants in 1 ms
[2024-05-25 16:32:33] [INFO ] Implicit Places using invariants in 282 ms returned [16, 21, 35, 54, 66, 85, 86, 99, 141, 144, 145, 179]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 284 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 6 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-25 16:32:33] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:32:34] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-25 16:32:34] [INFO ] Invariant cache hit.
[2024-05-25 16:32:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:32:34] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 904 ms. Remains : 184/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-08
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 1085 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(p1)||p0)))'
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 198 transition count 172
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 174 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 159 transition count 157
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 132 transition count 130
Applied a total of 132 rules in 23 ms. Remains 132 /198 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 132 cols
[2024-05-25 16:32:34] [INFO ] Computed 32 invariants in 6 ms
[2024-05-25 16:32:34] [INFO ] Implicit Places using invariants in 214 ms returned [9, 37, 44, 55, 56, 68, 95, 98, 99, 122]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 216 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 130/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 120 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 120 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 119 transition count 127
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 94 transition count 102
Applied a total of 56 rules in 14 ms. Remains 94 /122 variables (removed 28) and now considering 102/130 (removed 28) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-25 16:32:34] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:32:35] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-25 16:32:35] [INFO ] Invariant cache hit.
[2024-05-25 16:32:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:32:35] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/198 places, 102/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 735 ms. Remains : 94/198 places, 102/196 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09
Product exploration explored 100000 steps with 72 reset in 243 ms.
Product exploration explored 100000 steps with 84 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 3003 steps (0 resets) in 16 ms. (176 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 345 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-25 16:32:36] [INFO ] Invariant cache hit.
[2024-05-25 16:32:37] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-25 16:32:37] [INFO ] Invariant cache hit.
[2024-05-25 16:32:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:32:37] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-25 16:32:37] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-25 16:32:37] [INFO ] Invariant cache hit.
[2024-05-25 16:32:37] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:32:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2024-05-25 16:32:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:32:37] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:32:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:32:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/93 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:32:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:32:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:32:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:32:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:32:41] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:32:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:32:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 102/196 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 68/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 234 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8733 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/93 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 102/196 variables, 94/167 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 68/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 99/334 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:49] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 16:32:50] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/196 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/196 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 336 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7714 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 53/53 constraints]
After SMT, in 16482ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 16485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16839 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1433 steps (0 resets) in 9 ms. (143 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 82 reset in 139 ms.
Product exploration explored 100000 steps with 85 reset in 160 ms.
Built C files in :
/tmp/ltsmin5028067592142663606
[2024-05-25 16:32:54] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-25 16:32:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:32:54] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-25 16:32:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:32:54] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-25 16:32:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:32:54] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5028067592142663606
Running compilation step : cd /tmp/ltsmin5028067592142663606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 632 ms.
Running link step : cd /tmp/ltsmin5028067592142663606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5028067592142663606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10695421058647534049.hoa' '--buchi-type=spotba'
LTSmin run took 2044 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 22979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(X(p1))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 172 transition count 157
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 159 transition count 157
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 124 place count 136 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 135 transition count 133
Applied a total of 126 rules in 13 ms. Remains 135 /198 variables (removed 63) and now considering 133/196 (removed 63) transitions.
// Phase 1: matrix 133 rows 135 cols
[2024-05-25 16:32:57] [INFO ] Computed 32 invariants in 1 ms
[2024-05-25 16:32:57] [INFO ] Implicit Places using invariants in 179 ms returned [8, 11, 36, 43, 53, 54, 66, 97, 98, 125]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 181 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/198 places, 133/196 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 125 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 122 transition count 130
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 50 place count 100 transition count 108
Applied a total of 50 rules in 6 ms. Remains 100 /125 variables (removed 25) and now considering 108/133 (removed 25) transitions.
// Phase 1: matrix 108 rows 100 cols
[2024-05-25 16:32:57] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:32:58] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-25 16:32:58] [INFO ] Invariant cache hit.
[2024-05-25 16:32:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:32:58] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/198 places, 108/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 534 ms. Remains : 100/198 places, 108/196 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10
Product exploration explored 100000 steps with 3431 reset in 136 ms.
Product exploration explored 100000 steps with 3301 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 382 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
[2024-05-25 16:32:59] [INFO ] Invariant cache hit.
[2024-05-25 16:32:59] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 51/208 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 5/20 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 501 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-25 16:32:59] [INFO ] Invariant cache hit.
[2024-05-25 16:33:00] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-25 16:33:00] [INFO ] Invariant cache hit.
[2024-05-25 16:33:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:33:00] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-25 16:33:00] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-25 16:33:00] [INFO ] Invariant cache hit.
[2024-05-25 16:33:00] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:00] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:33:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:33:02] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:33:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:33:03] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-25 16:33:04] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:05] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:06] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:06] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 108/208 variables, 100/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 67/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 237 constraints, problems are : Problem set: 0 solved, 105 unsolved in 9914 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-25 16:33:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 108/208 variables, 100/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 67/238 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 105/343 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 343 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5348 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 49/49 constraints]
After SMT, in 15297ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 15300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15800 ms. Remains : 100/100 places, 108/108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3500 reset in 132 ms.
Product exploration explored 100000 steps with 3126 reset in 150 ms.
Built C files in :
/tmp/ltsmin12803886196465105749
[2024-05-25 16:33:16] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-25 16:33:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:33:16] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-25 16:33:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:33:16] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-25 16:33:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:33:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12803886196465105749
Running compilation step : cd /tmp/ltsmin12803886196465105749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin12803886196465105749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12803886196465105749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13177092958883390202.hoa' '--buchi-type=spotba'
LTSmin run took 2291 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 21820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((F(p1)||X(G(p2))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-25 16:33:19] [INFO ] Computed 32 invariants in 2 ms
[2024-05-25 16:33:19] [INFO ] Implicit Places using invariants in 262 ms returned [16, 21, 35, 54, 66, 86, 99, 141, 144, 145, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 264 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 187/198 places, 196/196 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11
Product exploration explored 100000 steps with 810 reset in 133 ms.
Product exploration explored 100000 steps with 808 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3254 steps (0 resets) in 13 ms. (232 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 362 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 196 rows 187 cols
[2024-05-25 16:33:21] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:33:21] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 16:33:21] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:33:21] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2024-05-25 16:33:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 16:33:21] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:33:22] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2024-05-25 16:33:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:33:22] [INFO ] [Nat]Added 68 Read/Feed constraints in 88 ms returned sat
[2024-05-25 16:33:22] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-25 16:33:22] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:33:22] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-25 16:33:22] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:33:23] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:33:24] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 3 ms to minimize.
[2024-05-25 16:33:24] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:33:24] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:33:24] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:33:24] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1950 ms
[2024-05-25 16:33:24] [INFO ] Computed and/alt/rep : 191/335/191 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-25 16:33:25] [INFO ] Added : 128 causal constraints over 26 iterations in 931 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-25 16:33:25] [INFO ] Invariant cache hit.
[2024-05-25 16:33:25] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-25 16:33:25] [INFO ] Invariant cache hit.
[2024-05-25 16:33:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:33:25] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-25 16:33:25] [INFO ] Invariant cache hit.
[2024-05-25 16:33:25] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:27] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-25 16:33:27] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:33:27] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:33:27] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 3 ms to minimize.
[2024-05-25 16:33:27] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 5 ms to minimize.
[2024-05-25 16:33:27] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 2 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:33:28] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:33:29] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:29] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:33:30] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-25 16:33:30] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:32] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-25 16:33:32] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:34] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 5/186 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:37] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:33:37] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:33:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:33:37] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-25 16:33:37] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-25 16:33:38] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-25 16:33:38] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 3 ms to minimize.
[2024-05-25 16:33:38] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-25 16:33:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:33:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:33:38] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-25 16:33:39] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:33:39] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-25 16:33:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:33:40] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:41] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-25 16:33:41] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-25 16:33:41] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-25 16:33:41] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 3 ms to minimize.
[2024-05-25 16:33:42] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-25 16:33:42] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-25 16:33:42] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-25 16:33:42] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:46] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 15 (OVERLAPS) 196/383 variables, 187/257 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 68/325 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:33:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 326 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 5/186 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 1/187 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:34:00] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:34:03] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 196/383 variables, 187/260 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 68/328 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 191/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (OVERLAPS) 0/383 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 519 constraints, problems are : Problem set: 0 solved, 191 unsolved in 25526 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 52/52 constraints]
After SMT, in 55582ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 55586ms
Finished structural reductions in LTL mode , in 1 iterations and 56238 ms. Remains : 187/187 places, 196/196 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7927 steps (0 resets) in 20 ms. (377 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 592 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2024-05-25 16:34:22] [INFO ] Invariant cache hit.
[2024-05-25 16:34:23] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-25 16:34:23] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:34:23] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2024-05-25 16:34:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:34:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-25 16:34:23] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:34:24] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2024-05-25 16:34:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:34:24] [INFO ] [Nat]Added 68 Read/Feed constraints in 77 ms returned sat
[2024-05-25 16:34:24] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 3 ms to minimize.
[2024-05-25 16:34:24] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2024-05-25 16:34:24] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
[2024-05-25 16:34:25] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-25 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2453 ms
[2024-05-25 16:34:26] [INFO ] Computed and/alt/rep : 191/335/191 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-25 16:34:28] [INFO ] Added : 166 causal constraints over 34 iterations in 1174 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 807 reset in 213 ms.
Product exploration explored 100000 steps with 797 reset in 211 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 187 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 35 place count 187 transition count 198
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 187 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 177 transition count 187
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 177 transition count 187
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 107 place count 177 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 152 transition count 162
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 157 rules in 16 ms. Remains 152 /187 variables (removed 35) and now considering 162/196 (removed 34) transitions.
[2024-05-25 16:34:28] [INFO ] Redundant transitions in 6 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 152 cols
[2024-05-25 16:34:28] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:34:28] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-25 16:34:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-25 16:34:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-25 16:34:31] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 16/33 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-05-25 16:34:31] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/34 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-05-25 16:34:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:34:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-25 16:34:32] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 3/37 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-05-25 16:34:33] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/38 constraints. Problems are: Problem set: 38 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 38 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 3/151 variables, 3/41 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:34:35] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:34:36] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:34:36] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-25 16:34:36] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-25 16:34:36] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 14/55 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-05-25 16:34:36] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/56 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-05-25 16:34:38] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-25 16:34:38] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:34:38] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-25 16:34:38] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-25 16:34:38] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:34:38] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 6/62 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-05-25 16:34:39] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 1/63 constraints. Problems are: Problem set: 48 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 48 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 1/152 variables, 1/64 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-25 16:34:42] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 6/70 constraints. Problems are: Problem set: 53 solved, 106 unsolved
[2024-05-25 16:34:42] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 1/71 constraints. Problems are: Problem set: 53 solved, 106 unsolved
[2024-05-25 16:34:44] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/72 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/72 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 18 (OVERLAPS) 162/314 variables, 152/224 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 68/292 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/292 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 21 (OVERLAPS) 0/314 variables, 0/292 constraints. Problems are: Problem set: 53 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 292 constraints, problems are : Problem set: 53 solved, 106 unsolved in 23040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 53 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 10/10 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/11 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 38/49 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/49 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 50/146 variables, 8/57 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 8/65 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/65 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 6/152 variables, 2/67 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 5/72 constraints. Problems are: Problem set: 53 solved, 106 unsolved
[2024-05-25 16:34:53] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/73 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/73 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 162/314 variables, 152/225 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 68/293 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 106/399 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/399 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 15 (OVERLAPS) 0/314 variables, 0/399 constraints. Problems are: Problem set: 53 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 399 constraints, problems are : Problem set: 53 solved, 106 unsolved in 9808 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 106/159 constraints, Known Traps: 52/52 constraints]
After SMT, in 32877ms problems are : Problem set: 53 solved, 106 unsolved
Search for dead transitions found 53 dead transitions in 32880ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/187 places, 109/196 transitions.
Graph (complete) has 336 edges and 152 vertex of which 100 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 100 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 100 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 9 ms. Remains 100 /152 variables (removed 52) and now considering 109/109 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/187 places, 109/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32922 ms. Remains : 100/187 places, 109/196 transitions.
Built C files in :
/tmp/ltsmin653405991230690031
[2024-05-25 16:35:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin653405991230690031
Running compilation step : cd /tmp/ltsmin653405991230690031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 759 ms.
Running link step : cd /tmp/ltsmin653405991230690031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin653405991230690031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1219090455392135884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 187 cols
[2024-05-25 16:35:17] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:35:17] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-25 16:35:17] [INFO ] Invariant cache hit.
[2024-05-25 16:35:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:35:17] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-25 16:35:17] [INFO ] Invariant cache hit.
[2024-05-25 16:35:17] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:19] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-25 16:35:19] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:35:19] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-25 16:35:19] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-25 16:35:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:35:19] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:35:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:35:21] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-25 16:35:21] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-25 16:35:21] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 3 ms to minimize.
[2024-05-25 16:35:21] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:22] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:35:22] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:35:22] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:25] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:35:25] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 5/186 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:31] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 3 ms to minimize.
[2024-05-25 16:35:31] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-25 16:35:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-25 16:35:31] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-05-25 16:35:31] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-25 16:35:32] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 4 ms to minimize.
[2024-05-25 16:35:32] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-05-25 16:35:32] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2024-05-25 16:35:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:35:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:35:32] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:35:33] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:35:33] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:35:34] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-25 16:35:34] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:35] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-25 16:35:36] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-25 16:35:36] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-25 16:35:36] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:35:36] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-25 16:35:36] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:35:37] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2024-05-25 16:35:37] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:41] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 15 (OVERLAPS) 196/383 variables, 187/257 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 68/325 constraints. Problems are: Problem set: 0 solved, 191 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 383/383 variables, and 325 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 5/186 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:35:51] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/187 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 196/383 variables, 187/258 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 191/517 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:36:01] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-25 16:36:08] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 519 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 52/52 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 187/187 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin8447472027885859212
[2024-05-25 16:36:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8447472027885859212
Running compilation step : cd /tmp/ltsmin8447472027885859212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 826 ms.
Running link step : cd /tmp/ltsmin8447472027885859212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8447472027885859212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11420440260309750889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 25 ms
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 22 ms
[2024-05-25 16:36:33] [INFO ] Time to serialize gal into /tmp/LTL16610042054668353950.gal : 8 ms
[2024-05-25 16:36:33] [INFO ] Time to serialize properties into /tmp/LTL441838752564296501.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16610042054668353950.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3019122905300771686.hoa' '-atoms' '/tmp/LTL441838752564296501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL441838752564296501.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3019122905300771686.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t71, t72, t73, t75, t77, t79,...447
Detected timeout of ITS tools.
[2024-05-25 16:36:48] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:36:48] [INFO ] Flatten gal took : 12 ms
[2024-05-25 16:36:48] [INFO ] Time to serialize gal into /tmp/LTL11355232717467812023.gal : 4 ms
[2024-05-25 16:36:48] [INFO ] Time to serialize properties into /tmp/LTL5023187579005771483.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11355232717467812023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5023187579005771483.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((robot_right==1)&&(arm2_pick_up_angle==1))&&(A1U_rot2_run==1))"))||(G((F("((arm2_release_ext==1)&&(A2U_ext_run==1))"))||(X(G(...175
Formula 0 simplified : G!"(((robot_right==1)&&(arm2_pick_up_angle==1))&&(A1U_rot2_run==1))" & F(G!"((arm2_release_ext==1)&&(A2U_ext_run==1))" & XF!"(CU_out...161
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t71, t72, t73, t75, t77, t79,...447
Detected timeout of ITS tools.
[2024-05-25 16:37:03] [INFO ] Flatten gal took : 17 ms
[2024-05-25 16:37:03] [INFO ] Applying decomposition
[2024-05-25 16:37:03] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1328893528767686941.txt' '-o' '/tmp/graph1328893528767686941.bin' '-w' '/tmp/graph1328893528767686941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1328893528767686941.bin' '-l' '-1' '-v' '-w' '/tmp/graph1328893528767686941.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:37:03] [INFO ] Decomposing Gal with order
[2024-05-25 16:37:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:37:03] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-25 16:37:03] [INFO ] Flatten gal took : 93 ms
[2024-05-25 16:37:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2024-05-25 16:37:03] [INFO ] Time to serialize gal into /tmp/LTL17224725313088724871.gal : 11 ms
[2024-05-25 16:37:03] [INFO ] Time to serialize properties into /tmp/LTL7718830310247044948.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17224725313088724871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7718830310247044948.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((i8.u59.robot_right==1)&&(i5.u32.arm2_pick_up_angle==1))&&(i8.u59.A1U_rot2_run==1))"))||(G((F("((i6.i0.u34.arm2_release_ext==...223
Formula 0 simplified : G!"(((i8.u59.robot_right==1)&&(i5.u32.arm2_pick_up_angle==1))&&(i8.u59.A1U_rot2_run==1))" & F(G!"((i6.i0.u34.arm2_release_ext==1)&&(...209
Reverse transition relation is NOT exact ! Due to transitions t65, t115, i0.u6.t6, i0.u7.t10, i1.i0.u14.t30, i1.i1.u9.t22, i1.i1.u11.t26, i1.i1.u13.t34, i2...786
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
426 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.31152,137636,1,0,290063,639,3004,195521,304,1578,758215
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-5-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 229216 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((G(p1)||G(p2)))&&p0)))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-25 16:37:08] [INFO ] Computed 32 invariants in 1 ms
[2024-05-25 16:37:08] [INFO ] Implicit Places using invariants in 245 ms returned [16, 21, 35, 54, 66, 85, 99, 141, 144, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 247 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 6 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 16:37:09] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:37:09] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-25 16:37:09] [INFO ] Invariant cache hit.
[2024-05-25 16:37:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:37:09] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1056 ms. Remains : 186/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 1256 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)||X(G(p1))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-25 16:37:10] [INFO ] Computed 32 invariants in 2 ms
[2024-05-25 16:37:10] [INFO ] Implicit Places using invariants in 305 ms returned [21, 35, 54, 66, 86, 99, 141, 144, 145, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 307 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 315 ms. Remains : 188/198 places, 196/196 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 172 transition count 156
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 158 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 132 place count 132 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 131 transition count 129
Applied a total of 134 rules in 21 ms. Remains 131 /198 variables (removed 67) and now considering 129/196 (removed 67) transitions.
// Phase 1: matrix 129 rows 131 cols
[2024-05-25 16:37:10] [INFO ] Computed 32 invariants in 2 ms
[2024-05-25 16:37:10] [INFO ] Implicit Places using invariants in 292 ms returned [8, 11, 21, 33, 40, 50, 64, 93, 96, 97, 121]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 293 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 129/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 115 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 115 transition count 124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 36 place count 102 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 101 transition count 110
Applied a total of 38 rules in 16 ms. Remains 101 /120 variables (removed 19) and now considering 110/129 (removed 19) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-05-25 16:37:10] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:37:11] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-25 16:37:11] [INFO ] Invariant cache hit.
[2024-05-25 16:37:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 16:37:11] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/198 places, 110/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 896 ms. Remains : 101/198 places, 110/196 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 228 steps with 0 reset with depth 229 and stack size 229 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 1198 ms.
All properties solved by simple procedures.
Total runtime 400792 ms.

BK_STOP 1716655031814

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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