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.r285-smll-171654421800028.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 gold2023
Input is ParamProductionCell-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:30 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-4-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716840856747

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:14:19] [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-27 20:14:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:14:19] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-27 20:14:19] [INFO ] Transformed 231 places.
[2024-05-27 20:14:19] [INFO ] Transformed 202 transitions.
[2024-05-27 20:14:19] [INFO ] Found NUPN structural information;
[2024-05-27 20:14:19] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-12 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 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 48 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2024-05-27 20:14:19] [INFO ] Computed 59 invariants in 28 ms
[2024-05-27 20:14:20] [INFO ] Implicit Places using invariants in 505 ms returned [16, 18, 24, 35, 36, 41, 42, 46, 47, 59, 64, 73, 79, 113, 118, 119, 161, 163, 165, 166, 192, 193, 196, 197, 207, 218]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 545 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/231 places, 198/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 608 ms. Remains : 201/231 places, 198/202 transitions.
Support contains 51 out of 201 places after structural reductions.
[2024-05-27 20:14:20] [INFO ] Flatten gal took : 61 ms
[2024-05-27 20:14:20] [INFO ] Flatten gal took : 24 ms
[2024-05-27 20:14:20] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 201 cols
[2024-05-27 20:14:21] [INFO ] Computed 33 invariants in 4 ms
[2024-05-27 20:14:21] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2024-05-27 20:14:21] [INFO ] [Real]Absence check using 23 positive and 10 generalized place invariants in 5 ms returned sat
[2024-05-27 20:14:21] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 18 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-27 20:14:22] [INFO ] Computed 33 invariants in 3 ms
[2024-05-27 20:14:22] [INFO ] Implicit Places using invariants in 249 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 176, 177]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 260 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 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 12 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:14:22] [INFO ] Computed 21 invariants in 3 ms
[2024-05-27 20:14:22] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 20:14:22] [INFO ] Invariant cache hit.
[2024-05-27 20:14:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:22] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 794 ms. Remains : 185/201 places, 194/198 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 339 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-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s132 0) (EQ s135 0)), p1:(AND (EQ s130 1) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 3 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-01 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(G(p2)&&p1))) U X(p3)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 12 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-27 20:14:23] [INFO ] Computed 33 invariants in 9 ms
[2024-05-27 20:14:23] [INFO ] Implicit Places using invariants in 188 ms returned [15, 17, 28, 54, 66, 85, 86, 100, 143, 176, 177]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 190 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/198 transitions.
Applied a total of 0 rules in 4 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 206 ms. Remains : 188/201 places, 196/198 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p3), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR p0 (AND p1 p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 5}, { cond=(OR p0 (AND p1 p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s94 1) (EQ s115 1)), p1:(AND (EQ s81 1) (EQ s84 1) (EQ s108 1)), p2:(EQ s167 1), p3:(AND (EQ s81 1) (EQ s84 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-02 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 10 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
[2024-05-27 20:14:23] [INFO ] Invariant cache hit.
[2024-05-27 20:14:23] [INFO ] Implicit Places using invariants in 239 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 102, 143, 176, 177]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 250 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 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 9 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:14:23] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 20:14:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-27 20:14:24] [INFO ] Invariant cache hit.
[2024-05-27 20:14:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:24] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 795 ms. Remains : 185/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s91 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1565 reset in 300 ms.
Product exploration explored 100000 steps with 1561 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-27 20:14:25] [INFO ] Invariant cache hit.
[2024-05-27 20:14:25] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 20:14:25] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-27 20:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:25] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-27 20:14:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 20:14:26] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-27 20:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:26] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-27 20:14:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 32 ms returned sat
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 4 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:14:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-27 20:14:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 739 ms
[2024-05-27 20:14:27] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-27 20:14:27] [INFO ] Added : 179 causal constraints over 36 iterations in 772 ms. Result :sat
Could not prove EG (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.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 185 transition count 159
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 150 transition count 159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 70 place count 150 transition count 145
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 98 place count 136 transition count 145
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 178 place count 96 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 94 transition count 103
Applied a total of 182 rules in 38 ms. Remains 94 /185 variables (removed 91) and now considering 103/194 (removed 91) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-05-27 20:14:27] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:14:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-27 20:14:28] [INFO ] Invariant cache hit.
[2024-05-27 20:14:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:14:28] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-27 20:14:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:14:28] [INFO ] Invariant cache hit.
[2024-05-27 20:14:28] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/185 places, 103/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 550 ms. Remains : 94/185 places, 103/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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-27 20:14:28] [INFO ] Invariant cache hit.
[2024-05-27 20:14:28] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 20:14:28] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:28] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-27 20:14:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 20:14:28] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-27 20:14:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:14:29] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 352 ms
[2024-05-27 20:14:29] [INFO ] Computed and/alt/rep : 100/220/100 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:14:29] [INFO ] Added : 91 causal constraints over 19 iterations in 236 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2983 reset in 207 ms.
Product exploration explored 100000 steps with 2960 reset in 207 ms.
Built C files in :
/tmp/ltsmin9076422166957907464
[2024-05-27 20:14:30] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2024-05-27 20:14:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:14:30] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2024-05-27 20:14:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:14:30] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2024-05-27 20:14:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:14:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9076422166957907464
Running compilation step : cd /tmp/ltsmin9076422166957907464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 622 ms.
Running link step : cd /tmp/ltsmin9076422166957907464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9076422166957907464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8977558776863470269.hoa' '--buchi-type=spotba'
LTSmin run took 314 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-03 finished in 7500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((!p0&&X((F(!p1)||G(!p0))))))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 197
Applied a total of 2 rules in 7 ms. Remains 200 /201 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 200 cols
[2024-05-27 20:14:31] [INFO ] Computed 33 invariants in 2 ms
[2024-05-27 20:14:31] [INFO ] Implicit Places using invariants in 182 ms returned [15, 17, 28, 54, 66, 86, 88, 100, 102, 143, 177, 178]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 183 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 188/201 places, 197/198 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s80 1) (EQ s85 1) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7581 steps with 0 reset in 27 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-05 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions 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 201 transition count 173
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 176 transition count 173
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 176 transition count 159
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 162 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 160 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 160 transition count 157
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 134 place count 134 transition count 131
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 136 place count 133 transition count 130
Applied a total of 136 rules in 50 ms. Remains 133 /201 variables (removed 68) and now considering 130/198 (removed 68) transitions.
// Phase 1: matrix 130 rows 133 cols
[2024-05-27 20:14:31] [INFO ] Computed 33 invariants in 2 ms
[2024-05-27 20:14:31] [INFO ] Implicit Places using invariants in 194 ms returned [9, 10, 17, 33, 40, 51, 52, 66, 68, 98, 121, 122]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 197 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/201 places, 130/198 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 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 2 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 4 place count 119 transition count 128
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 42 place count 100 transition count 109
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 44 place count 99 transition count 108
Applied a total of 44 rules in 17 ms. Remains 99 /121 variables (removed 22) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 99 cols
[2024-05-27 20:14:31] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:14:32] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-27 20:14:32] [INFO ] Invariant cache hit.
[2024-05-27 20:14:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:14:32] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/201 places, 108/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 679 ms. Remains : 99/201 places, 108/198 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s40 1) (EQ s72 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 156 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 2 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions 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 201 transition count 172
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 175 transition count 172
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 175 transition count 158
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 161 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 159 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 159 transition count 156
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 132 place count 135 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 134 place count 134 transition count 131
Applied a total of 134 rules in 28 ms. Remains 134 /201 variables (removed 67) and now considering 131/198 (removed 67) transitions.
// Phase 1: matrix 131 rows 134 cols
[2024-05-27 20:14:32] [INFO ] Computed 33 invariants in 1 ms
[2024-05-27 20:14:32] [INFO ] Implicit Places using invariants in 149 ms returned [9, 10, 17, 41, 52, 53, 55, 67, 69, 99, 122, 123]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 150 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/201 places, 131/198 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 121 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 121 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 118 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 116 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 116 transition count 125
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 66 place count 89 transition count 98
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 68 place count 88 transition count 97
Applied a total of 68 rules in 15 ms. Remains 88 /122 variables (removed 34) and now considering 97/131 (removed 34) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-27 20:14:32] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:14:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-27 20:14:32] [INFO ] Invariant cache hit.
[2024-05-27 20:14:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:14:32] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/201 places, 97/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 475 ms. Remains : 88/201 places, 97/198 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-07 finished in 668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 5 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-27 20:14:33] [INFO ] Computed 33 invariants in 1 ms
[2024-05-27 20:14:33] [INFO ] Implicit Places using invariants in 230 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 143, 176]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 232 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 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 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:14:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:14:33] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-27 20:14:33] [INFO ] Invariant cache hit.
[2024-05-27 20:14:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:33] [INFO ] Implicit Places using invariants and state equation in 348 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/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 714 ms. Remains : 185/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s160 1) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 668 reset in 123 ms.
Product exploration explored 100000 steps with 663 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 144 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=72 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-27 20:14:34] [INFO ] Invariant cache hit.
[2024-05-27 20:14:34] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-27 20:14:34] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:35] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-05-27 20:14:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 20:14:35] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:35] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-27 20:14:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:35] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2024-05-27 20:14:35] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:14:35] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:14:35] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2024-05-27 20:14:35] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:14:35] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:14:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 6 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2024-05-27 20:14:37] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2206 ms
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 20:14:38] [INFO ] Added : 171 causal constraints over 35 iterations in 691 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 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-27 20:14:38] [INFO ] Invariant cache hit.
[2024-05-27 20:14:38] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-27 20:14:38] [INFO ] Invariant cache hit.
[2024-05-27 20:14:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:38] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-27 20:14:38] [INFO ] Invariant cache hit.
[2024-05-27 20:14:39] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 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), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 137 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-27 20:14:39] [INFO ] Invariant cache hit.
[2024-05-27 20:14:39] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-27 20:14:39] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:39] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-05-27 20:14:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-27 20:14:40] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:14:40] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-27 20:14:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:40] [INFO ] [Nat]Added 68 Read/Feed constraints in 15 ms returned sat
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2155 ms
[2024-05-27 20:14:42] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-27 20:14:43] [INFO ] Added : 171 causal constraints over 35 iterations in 705 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 668 reset in 129 ms.
Product exploration explored 100000 steps with 660 reset in 139 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(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 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 185 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 34 place count 185 transition count 196
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 185 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 175 transition count 185
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 175 transition count 185
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 110 place count 175 transition count 185
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 133 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 156 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 156 rules in 41 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2024-05-27 20:14:43] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2024-05-27 20:14:43] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:14:44] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 162/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 152/185 places, 162/194 transitions.
Built C files in :
/tmp/ltsmin14141525274126499280
[2024-05-27 20:14:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14141525274126499280
Running compilation step : cd /tmp/ltsmin14141525274126499280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin14141525274126499280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14141525274126499280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11734158125595677275.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:14:59] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:14:59] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-27 20:14:59] [INFO ] Invariant cache hit.
[2024-05-27 20:14:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:14:59] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2024-05-27 20:14:59] [INFO ] Invariant cache hit.
[2024-05-27 20:15:00] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 927 ms. Remains : 185/185 places, 194/194 transitions.
Built C files in :
/tmp/ltsmin8235377205188786882
[2024-05-27 20:15:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8235377205188786882
Running compilation step : cd /tmp/ltsmin8235377205188786882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 737 ms.
Running link step : cd /tmp/ltsmin8235377205188786882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8235377205188786882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13716872857416217361.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:15:15] [INFO ] Flatten gal took : 18 ms
[2024-05-27 20:15:15] [INFO ] Flatten gal took : 16 ms
[2024-05-27 20:15:15] [INFO ] Time to serialize gal into /tmp/LTL11986285624390494236.gal : 5 ms
[2024-05-27 20:15:15] [INFO ] Time to serialize properties into /tmp/LTL4081450534812256410.prop : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11986285624390494236.gal' '-t' 'CGAL' '-hoa' '/tmp/aut743882063126993233.hoa' '-atoms' '/tmp/LTL4081450534812256410.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4081450534812256410.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut743882063126993233.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80,...442
Detected timeout of ITS tools.
[2024-05-27 20:15:30] [INFO ] Flatten gal took : 13 ms
[2024-05-27 20:15:30] [INFO ] Flatten gal took : 12 ms
[2024-05-27 20:15:30] [INFO ] Time to serialize gal into /tmp/LTL10334815077216673528.gal : 3 ms
[2024-05-27 20:15:30] [INFO ] Time to serialize properties into /tmp/LTL7190439811993100380.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10334815077216673528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7190439811993100380.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((CU_ready_to_transport==1)&&(crane_stop_h==1))")))))
Formula 0 simplified : XXG!"((CU_ready_to_transport==1)&&(crane_stop_h==1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80,...442
Detected timeout of ITS tools.
[2024-05-27 20:15:45] [INFO ] Flatten gal took : 12 ms
[2024-05-27 20:15:45] [INFO ] Applying decomposition
[2024-05-27 20:15:45] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6547864776096108372.txt' '-o' '/tmp/graph6547864776096108372.bin' '-w' '/tmp/graph6547864776096108372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6547864776096108372.bin' '-l' '-1' '-v' '-w' '/tmp/graph6547864776096108372.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:15:45] [INFO ] Decomposing Gal with order
[2024-05-27 20:15:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:15:45] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-27 20:15:45] [INFO ] Flatten gal took : 65 ms
[2024-05-27 20:15:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-27 20:15:45] [INFO ] Time to serialize gal into /tmp/LTL1896234286730414359.gal : 8 ms
[2024-05-27 20:15:45] [INFO ] Time to serialize properties into /tmp/LTL8192880856958799243.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1896234286730414359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8192880856958799243.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i9.i0.u66.CU_ready_to_transport==1)&&(i10.i1.u71.crane_stop_h==1))")))))
Formula 0 simplified : XXG!"((i9.i0.u66.CU_ready_to_transport==1)&&(i10.i1.u71.crane_stop_h==1))"
Reverse transition relation is NOT exact ! Due to transitions t118, t179, t192, i0.i0.u11.t26, i0.i1.u8.t22, i0.i1.u12.t34, i0.i1.u14.t30, i1.i0.u2.t14, i1...834
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
107 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,1.10358,52916,1,0,107210,211,3307,66322,171,582,188081
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-4-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 73761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions 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 201 transition count 172
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 175 transition count 172
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 175 transition count 158
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 161 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 159 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 159 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 136 place count 133 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 138 place count 132 transition count 129
Applied a total of 138 rules in 17 ms. Remains 132 /201 variables (removed 69) and now considering 129/198 (removed 69) transitions.
// Phase 1: matrix 129 rows 132 cols
[2024-05-27 20:15:46] [INFO ] Computed 33 invariants in 2 ms
[2024-05-27 20:15:47] [INFO ] Implicit Places using invariants in 192 ms returned [9, 10, 17, 32, 39, 50, 51, 53, 65, 67, 97, 121]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 193 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/201 places, 129/198 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 120 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 119 transition count 128
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 119 transition count 125
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 116 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 114 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 114 transition count 123
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 64 place count 88 transition count 97
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 66 place count 87 transition count 96
Applied a total of 66 rules in 10 ms. Remains 87 /120 variables (removed 33) and now considering 96/129 (removed 33) transitions.
// Phase 1: matrix 96 rows 87 cols
[2024-05-27 20:15:47] [INFO ] Computed 21 invariants in 0 ms
[2024-05-27 20:15:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 20:15:47] [INFO ] Invariant cache hit.
[2024-05-27 20:15:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:15:47] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/201 places, 96/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 514 ms. Remains : 87/201 places, 96/198 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s77 1) (EQ s80 1)), p1:(OR (EQ s39 0) (EQ s56 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1349 reset in 137 ms.
Product exploration explored 100000 steps with 1345 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 92 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-27 20:15:48] [INFO ] Invariant cache hit.
[2024-05-27 20:15:48] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:15:48] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:15:48] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-27 20:15:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:15:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-27 20:15:48] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:15:48] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-27 20:15:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:15:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-27 20:15:48] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:15:48] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-27 20:15:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:15:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:15:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 20:15:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-27 20:15:50] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 1284 ms
[2024-05-27 20:15:50] [INFO ] Computed and/alt/rep : 93/219/93 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:15:50] [INFO ] Added : 88 causal constraints over 18 iterations in 208 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-27 20:15:50] [INFO ] Invariant cache hit.
[2024-05-27 20:15:50] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 20:15:50] [INFO ] Invariant cache hit.
[2024-05-27 20:15:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:15:50] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-27 20:15:50] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-27 20:15:50] [INFO ] Invariant cache hit.
[2024-05-27 20:15:50] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 87/87 places, 96/96 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) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-27 20:15:51] [INFO ] Invariant cache hit.
[2024-05-27 20:15:51] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:15:51] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-27 20:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:15:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:15:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:15:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:15:51] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:15:51] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-27 20:15:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:15:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 1290 ms
[2024-05-27 20:15:52] [INFO ] Computed and/alt/rep : 93/219/93 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:15:53] [INFO ] Added : 88 causal constraints over 18 iterations in 203 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1346 reset in 131 ms.
Product exploration explored 100000 steps with 1352 reset in 154 ms.
Built C files in :
/tmp/ltsmin11222512886080833383
[2024-05-27 20:15:53] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-27 20:15:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:15:53] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-27 20:15:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:15:53] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-27 20:15:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:15:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11222512886080833383
Running compilation step : cd /tmp/ltsmin11222512886080833383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin11222512886080833383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11222512886080833383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1806027579943301426.hoa' '--buchi-type=spotba'
LTSmin run took 1465 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 8474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G((F(p1)&&F(p2)))))))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 4 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-27 20:15:55] [INFO ] Computed 33 invariants in 1 ms
[2024-05-27 20:15:55] [INFO ] Implicit Places using invariants in 206 ms returned [15, 17, 28, 54, 66, 85, 86, 100, 102, 143, 176, 177]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 207 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/198 transitions.
Applied a total of 0 rules in 1 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 214 ms. Remains : 187/201 places, 196/198 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s81 1) (EQ s84 1) (EQ s129 1)), p1:(AND (EQ s34 1) (EQ s39 1)), p2:(OR (EQ s34 0) (EQ s39 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1177 reset in 130 ms.
Product exploration explored 100000 steps with 1166 reset in 168 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) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 66 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 196 rows 187 cols
[2024-05-27 20:15:56] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 20:15:56] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:15:56] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:15:57] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-27 20:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:15:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-27 20:15:57] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-27 20:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:15:57] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-27 20:15:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:15:57] [INFO ] [Nat]Added 68 Read/Feed constraints in 38 ms returned sat
[2024-05-27 20:15:57] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:15:57] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2024-05-27 20:15:57] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:15:57] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-27 20:15:57] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-27 20:15:57] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 2 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-27 20:15:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 0 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:15:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2068 ms
[2024-05-27 20:15:59] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-27 20:16:00] [INFO ] Added : 172 causal constraints over 35 iterations in 790 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 187 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 : 187/187 places, 196/196 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 187 transition count 158
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 149 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 147 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 147 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 104 place count 135 transition count 144
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 174 place count 100 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 178 place count 98 transition count 107
Applied a total of 178 rules in 16 ms. Remains 98 /187 variables (removed 89) and now considering 107/196 (removed 89) transitions.
// Phase 1: matrix 107 rows 98 cols
[2024-05-27 20:16:00] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:16:00] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-27 20:16:00] [INFO ] Invariant cache hit.
[2024-05-27 20:16:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:00] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-27 20:16:00] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-27 20:16:00] [INFO ] Invariant cache hit.
[2024-05-27 20:16:00] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/187 places, 107/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 98/187 places, 107/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 p1) p2), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
[2024-05-27 20:16:01] [INFO ] Invariant cache hit.
[2024-05-27 20:16:01] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:16:01] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:01] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:16:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-27 20:16:01] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:01] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-27 20:16:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:01] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 801 ms
[2024-05-27 20:16:02] [INFO ] Computed and/alt/rep : 97/238/97 causal constraints (skipped 7 transitions) in 8 ms.
[2024-05-27 20:16:02] [INFO ] Added : 75 causal constraints over 15 iterations in 195 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2296 reset in 131 ms.
Product exploration explored 100000 steps with 2306 reset in 150 ms.
Built C files in :
/tmp/ltsmin5782931225966306110
[2024-05-27 20:16:03] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2024-05-27 20:16:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:16:03] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2024-05-27 20:16:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:16:03] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2024-05-27 20:16:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:16:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5782931225966306110
Running compilation step : cd /tmp/ltsmin5782931225966306110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 323 ms.
Running link step : cd /tmp/ltsmin5782931225966306110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5782931225966306110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17578576504033881962.hoa' '--buchi-type=spotba'
LTSmin run took 3237 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-10 finished in 11310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(G(p0)))))))'
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 3 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-27 20:16:06] [INFO ] Computed 33 invariants in 2 ms
[2024-05-27 20:16:06] [INFO ] Implicit Places using invariants in 162 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 143, 176, 177]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 163 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/201 places, 196/198 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 5 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-27 20:16:06] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 20:16:07] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-27 20:16:07] [INFO ] Invariant cache hit.
[2024-05-27 20:16:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:16:07] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 184/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-11 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p2)&&p1))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 201 transition count 178
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 181 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 179 transition count 176
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 44 place count 179 transition count 159
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 78 place count 162 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 160 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 160 transition count 157
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 130 place count 136 transition count 133
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 3 with 2 rules applied. Total rules applied 132 place count 135 transition count 132
Applied a total of 132 rules in 17 ms. Remains 135 /201 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 135 cols
[2024-05-27 20:16:07] [INFO ] Computed 33 invariants in 1 ms
[2024-05-27 20:16:07] [INFO ] Implicit Places using invariants in 162 ms returned [10, 11, 34, 53, 54, 56, 68, 70, 100, 123, 124]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 164 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/201 places, 132/198 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 123 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 123 transition count 129
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 121 transition count 129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 119 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 119 transition count 127
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 62 place count 93 transition count 101
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 64 place count 92 transition count 100
Applied a total of 64 rules in 10 ms. Remains 92 /124 variables (removed 32) and now considering 100/132 (removed 32) transitions.
// Phase 1: matrix 100 rows 92 cols
[2024-05-27 20:16:07] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:16:07] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-27 20:16:07] [INFO ] Invariant cache hit.
[2024-05-27 20:16:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:07] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/201 places, 100/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 540 ms. Remains : 92/201 places, 100/198 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s12 1)), p1:(AND (EQ s35 1) (EQ s37 1)), p2:(AND (EQ s9 1) (EQ s15 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1249 reset in 153 ms.
Product exploration explored 100000 steps with 1272 reset in 175 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 (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 137 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 34 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-27 20:16:09] [INFO ] Invariant cache hit.
[2024-05-27 20:16:09] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:16:09] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:09] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-27 20:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:16:09] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:09] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-27 20:16:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:16:09] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 655 ms
[2024-05-27 20:16:10] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:16:10] [INFO ] Added : 79 causal constraints over 17 iterations in 201 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-27 20:16:10] [INFO ] Invariant cache hit.
[2024-05-27 20:16:10] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-27 20:16:10] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:10] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-27 20:16:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:16:10] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-27 20:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:10] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-27 20:16:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:16:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:16:11] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:16:12] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:16:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:16:12] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:16:12] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:16:12] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1409 ms
[2024-05-27 20:16:12] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 20:16:12] [INFO ] Added : 59 causal constraints over 12 iterations in 151 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 20:16:12] [INFO ] Invariant cache hit.
[2024-05-27 20:16:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 20:16:12] [INFO ] Invariant cache hit.
[2024-05-27 20:16:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:12] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-27 20:16:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:16:12] [INFO ] Invariant cache hit.
[2024-05-27 20:16:12] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 92/92 places, 100/100 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 (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 138 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 33 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 330 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-27 20:16:13] [INFO ] Invariant cache hit.
[2024-05-27 20:16:13] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:16:13] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:13] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-27 20:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:16:13] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:13] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-27 20:16:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2024-05-27 20:16:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 20:16:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-27 20:16:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 641 ms
[2024-05-27 20:16:14] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:16:14] [INFO ] Added : 79 causal constraints over 17 iterations in 202 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-27 20:16:14] [INFO ] Invariant cache hit.
[2024-05-27 20:16:14] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:16:14] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:14] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-27 20:16:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:16:15] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 20:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:16:15] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:16:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:16:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:16:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:16:16] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1264 ms
[2024-05-27 20:16:16] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:16:16] [INFO ] Added : 59 causal constraints over 12 iterations in 149 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1238 reset in 165 ms.
Product exploration explored 100000 steps with 1297 reset in 181 ms.
Built C files in :
/tmp/ltsmin2547902470149454283
[2024-05-27 20:16:16] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-27 20:16:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:16:16] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-27 20:16:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:16:16] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-27 20:16:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:16:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2547902470149454283
Running compilation step : cd /tmp/ltsmin2547902470149454283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 305 ms.
Running link step : cd /tmp/ltsmin2547902470149454283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2547902470149454283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16708531552060737707.hoa' '--buchi-type=spotba'
LTSmin run took 2412 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-13 finished in 12305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&G(p2)&&p0)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 197
Applied a total of 2 rules in 3 ms. Remains 200 /201 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 200 cols
[2024-05-27 20:16:19] [INFO ] Computed 33 invariants in 2 ms
[2024-05-27 20:16:19] [INFO ] Implicit Places using invariants in 151 ms returned [17, 28, 54, 66, 85, 100, 102, 144, 177, 178]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 152 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/201 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 190/201 places, 197/198 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (NEQ s4 1) (NEQ s15 1)), p1:(AND (EQ s83 1) (EQ s130 1)), p0:(AND (EQ s81 1) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)&&F(G(p2))))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 196
Applied a total of 4 rules in 6 ms. Remains 199 /201 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 199 cols
[2024-05-27 20:16:20] [INFO ] Computed 33 invariants in 1 ms
[2024-05-27 20:16:20] [INFO ] Implicit Places using invariants in 225 ms returned [15, 17, 28, 54, 66, 85, 86, 88, 100, 102, 143, 176, 177]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 226 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/201 places, 196/198 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 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-27 20:16:20] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 20:16:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-27 20:16:20] [INFO ] Invariant cache hit.
[2024-05-27 20:16:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:16:20] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/201 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 670 ms. Remains : 184/201 places, 194/198 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s161 0) (EQ s169 0)), p1:(AND (EQ s78 1) (EQ s86 1)), p2:(AND (EQ s61 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 209 steps with 0 reset with depth 210 and stack size 210 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-15 finished in 998 ms.
All properties solved by simple procedures.
Total runtime 121981 ms.

BK_STOP 1716840982223

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ParamProductionCell-PT-4, 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 r285-smll-171654421800028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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