Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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-1-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678917443784

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 21:57:27] [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]
[2023-03-15 21:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:57:27] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-15 21:57:27] [INFO ] Transformed 231 places.
[2023-03-15 21:57:27] [INFO ] Transformed 202 transitions.
[2023-03-15 21:57:27] [INFO ] Found NUPN structural information;
[2023-03-15 21:57:27] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-15 TRUE 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 81 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2023-03-15 21:57:27] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-15 21:57:28] [INFO ] Implicit Places using invariants in 809 ms returned [1, 15, 16, 18, 19, 24, 31, 35, 47, 59, 64, 65, 73, 78, 79, 101, 114, 119, 120, 160, 166, 189, 191, 192, 196, 201, 202, 206]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 874 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 197/202 transitions.
Applied a total of 0 rules in 19 ms. Remains 198 /198 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 976 ms. Remains : 198/231 places, 197/202 transitions.
Support contains 51 out of 198 places after structural reductions.
[2023-03-15 21:57:29] [INFO ] Flatten gal took : 112 ms
[2023-03-15 21:57:29] [INFO ] Flatten gal took : 37 ms
[2023-03-15 21:57:29] [INFO ] Input system was already deterministic with 197 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 197 rows 198 cols
[2023-03-15 21:57:31] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-15 21:57:31] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2023-03-15 21:57:31] [INFO ] [Real]Absence check using 22 positive and 9 generalized place invariants in 13 ms returned sat
[2023-03-15 21:57:31] [INFO ] After 669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 21:57:31] [INFO ] [Nat]Absence check using 22 positive place invariants in 28 ms returned sat
[2023-03-15 21:57:31] [INFO ] [Nat]Absence check using 22 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 21:57:32] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-15 21:57:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:57:32] [INFO ] After 141ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-15 21:57:32] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 12 ms to minimize.
[2023-03-15 21:57:32] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2023-03-15 21:57:32] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2023-03-15 21:57:33] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2023-03-15 21:57:33] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 2 ms to minimize.
[2023-03-15 21:57:33] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:57:33] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-15 21:57:33] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 2 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 1 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 2067 ms
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 268 ms
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2023-03-15 21:57:34] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 1 ms to minimize.
[2023-03-15 21:57:35] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2023-03-15 21:57:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 407 ms
[2023-03-15 21:57:35] [INFO ] After 2952ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :0
[2023-03-15 21:57:35] [INFO ] After 3379ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-1-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-1-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-1-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA ParamProductionCell-PT-1-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 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 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 138 place count 129 transition count 128
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 140 place count 128 transition count 127
Applied a total of 140 rules in 110 ms. Remains 128 /198 variables (removed 70) and now considering 127/197 (removed 70) transitions.
// Phase 1: matrix 127 rows 128 cols
[2023-03-15 21:57:35] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-15 21:57:35] [INFO ] Implicit Places using invariants in 252 ms returned [0, 4, 7, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 89, 92, 113, 122]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 254 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/198 places, 127/197 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 109 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 105 transition count 121
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 72 place count 75 transition count 91
Applied a total of 72 rules in 24 ms. Remains 75 /111 variables (removed 36) and now considering 91/127 (removed 36) transitions.
// Phase 1: matrix 91 rows 75 cols
[2023-03-15 21:57:35] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 21:57:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-15 21:57:36] [INFO ] Invariant cache hit.
[2023-03-15 21:57:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:36] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/198 places, 91/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 786 ms. Remains : 75/198 places, 91/197 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3333 reset in 566 ms.
Product exploration explored 100000 steps with 3333 reset in 239 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 based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 244 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)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-15 21:57:37] [INFO ] Invariant cache hit.
[2023-03-15 21:57:38] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 21:57:38] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 21:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:38] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-15 21:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:57:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 21:57:38] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 21:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:38] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-15 21:57:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:38] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 490 ms
[2023-03-15 21:57:38] [INFO ] Computed and/alt/rep : 90/220/90 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 21:57:39] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2023-03-15 21:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-15 21:57:39] [INFO ] Added : 83 causal constraints over 18 iterations in 438 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 91/91 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-15 21:57:39] [INFO ] Invariant cache hit.
[2023-03-15 21:57:39] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-15 21:57:39] [INFO ] Invariant cache hit.
[2023-03-15 21:57:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:39] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-15 21:57:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 21:57:39] [INFO ] Invariant cache hit.
[2023-03-15 21:57:39] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 75/75 places, 91/91 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 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 182 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-15 21:57:40] [INFO ] Invariant cache hit.
[2023-03-15 21:57:40] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 21:57:40] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 21:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:40] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-15 21:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:57:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 21:57:40] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-15 21:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:40] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-15 21:57:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:40] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 492 ms
[2023-03-15 21:57:41] [INFO ] Computed and/alt/rep : 90/220/90 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-15 21:57:41] [INFO ] Added : 83 causal constraints over 18 iterations in 426 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3333 reset in 312 ms.
Product exploration explored 100000 steps with 3333 reset in 222 ms.
Built C files in :
/tmp/ltsmin9523741236983341272
[2023-03-15 21:57:42] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2023-03-15 21:57:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:42] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2023-03-15 21:57:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:42] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2023-03-15 21:57:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:42] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9523741236983341272
Running compilation step : cd /tmp/ltsmin9523741236983341272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 686 ms.
Running link step : cd /tmp/ltsmin9523741236983341272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin9523741236983341272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2407491956026813409.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-00 finished in 7808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 13 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 21:57:43] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-15 21:57:43] [INFO ] Implicit Places using invariants in 283 ms returned [28, 33, 34, 38, 83, 84, 97, 99, 140, 142, 144, 188]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 296 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 14 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2023-03-15 21:57:43] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 21:57:43] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-15 21:57:43] [INFO ] Invariant cache hit.
[2023-03-15 21:57:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:57:44] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1112 ms. Remains : 183/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s157 1) (EQ s171 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-01 finished in 1364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 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 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 138 place count 129 transition count 128
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 140 place count 128 transition count 127
Applied a total of 140 rules in 43 ms. Remains 128 /198 variables (removed 70) and now considering 127/197 (removed 70) transitions.
// Phase 1: matrix 127 rows 128 cols
[2023-03-15 21:57:44] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 21:57:45] [INFO ] Implicit Places using invariants in 278 ms returned [0, 4, 7, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 89, 90, 92, 113, 122]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 280 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/198 places, 127/197 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 108 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 104 transition count 121
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 78 place count 71 transition count 88
Applied a total of 78 rules in 33 ms. Remains 71 /110 variables (removed 39) and now considering 88/127 (removed 39) transitions.
// Phase 1: matrix 88 rows 71 cols
[2023-03-15 21:57:45] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-15 21:57:45] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-15 21:57:45] [INFO ] Invariant cache hit.
[2023-03-15 21:57:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:45] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/198 places, 88/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 719 ms. Remains : 71/198 places, 88/197 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1800 reset in 240 ms.
Product exploration explored 100000 steps with 1798 reset in 205 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 based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
[2023-03-15 21:57:46] [INFO ] Invariant cache hit.
[2023-03-15 21:57:46] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 21:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:46] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-15 21:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:57:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 21:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:47] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-15 21:57:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:47] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 704 ms
[2023-03-15 21:57:47] [INFO ] Computed and/alt/rep : 87/209/87 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 21:57:48] [INFO ] Added : 84 causal constraints over 17 iterations in 294 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 71 /71 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-15 21:57:48] [INFO ] Invariant cache hit.
[2023-03-15 21:57:48] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 21:57:48] [INFO ] Invariant cache hit.
[2023-03-15 21:57:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:48] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-15 21:57:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 21:57:48] [INFO ] Invariant cache hit.
[2023-03-15 21:57:48] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 71/71 places, 88/88 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 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2023-03-15 21:57:49] [INFO ] Invariant cache hit.
[2023-03-15 21:57:49] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 21:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:49] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-15 21:57:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:57:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 21:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:57:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-15 21:57:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:49] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 656 ms
[2023-03-15 21:57:50] [INFO ] Computed and/alt/rep : 87/209/87 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 21:57:50] [INFO ] Added : 84 causal constraints over 17 iterations in 298 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1798 reset in 178 ms.
Product exploration explored 100000 steps with 1799 reset in 130 ms.
Built C files in :
/tmp/ltsmin18059157666883553511
[2023-03-15 21:57:50] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2023-03-15 21:57:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:50] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2023-03-15 21:57:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:50] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2023-03-15 21:57:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18059157666883553511
Running compilation step : cd /tmp/ltsmin18059157666883553511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin18059157666883553511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18059157666883553511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11931851478411399442.hoa' '--buchi-type=spotba'
LTSmin run took 371 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-02 finished in 6828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 198 transition count 173
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 174 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 174 transition count 161
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 134 place count 131 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 136 place count 130 transition count 129
Applied a total of 136 rules in 26 ms. Remains 130 /198 variables (removed 68) and now considering 129/197 (removed 68) transitions.
// Phase 1: matrix 129 rows 130 cols
[2023-03-15 21:57:51] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-15 21:57:51] [INFO ] Implicit Places using invariants in 254 ms returned [0, 4, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 90, 91, 93, 115, 124]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 276 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/198 places, 129/197 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 113 transition count 126
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 126
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 70 place count 78 transition count 94
Applied a total of 70 rules in 14 ms. Remains 78 /113 variables (removed 35) and now considering 94/129 (removed 35) transitions.
// Phase 1: matrix 94 rows 78 cols
[2023-03-15 21:57:51] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 21:57:51] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-15 21:57:51] [INFO ] Invariant cache hit.
[2023-03-15 21:57:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:52] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/198 places, 94/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 718 ms. Remains : 78/198 places, 94/197 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s66 1) (NEQ s72 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1318 reset in 174 ms.
Product exploration explored 100000 steps with 1204 reset in 354 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-15 21:57:53] [INFO ] Invariant cache hit.
[2023-03-15 21:57:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-15 21:57:53] [INFO ] Invariant cache hit.
[2023-03-15 21:57:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:57:53] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-15 21:57:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 21:57:53] [INFO ] Invariant cache hit.
[2023-03-15 21:57:53] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 78/78 places, 94/94 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1293 reset in 178 ms.
Product exploration explored 100000 steps with 1252 reset in 205 ms.
Built C files in :
/tmp/ltsmin18222928279614702360
[2023-03-15 21:57:55] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2023-03-15 21:57:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:55] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2023-03-15 21:57:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:55] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2023-03-15 21:57:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:57:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18222928279614702360
Running compilation step : cd /tmp/ltsmin18222928279614702360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 428 ms.
Running link step : cd /tmp/ltsmin18222928279614702360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18222928279614702360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1066949732700099332.hoa' '--buchi-type=spotba'
LTSmin run took 282 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-03 finished in 4367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (G(p1)||F(p2))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 9 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 21:57:55] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 21:57:56] [INFO ] Implicit Places using invariants in 239 ms returned [28, 33, 38, 83, 84, 97, 99, 142, 170, 188]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 252 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 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 19 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 21:57:56] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 21:57:56] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-15 21:57:56] [INFO ] Invariant cache hit.
[2023-03-15 21:57:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:57:56] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 918 ms. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s135 1) (EQ s151 1)), p2:(AND (EQ s29 1) (EQ s32 1)), p0:(AND (EQ s132 1) (EQ s134 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 1388 reset in 167 ms.
Product exploration explored 100000 steps with 1387 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1070 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) p0), false, (NOT p2)]
Finished random walk after 90 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1)), (F (OR p0 p1)), (F p0)]
Knowledge based reduction with 15 factoid took 810 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
[2023-03-15 21:57:59] [INFO ] Invariant cache hit.
[2023-03-15 21:57:59] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-15 21:57:59] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-15 21:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:00] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-15 21:58:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2023-03-15 21:58:00] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 21:58:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:00] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-15 21:58:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 58 ms returned sat
[2023-03-15 21:58:00] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 3 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-15 21:58:01] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 7 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 3 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 3 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2087 ms
[2023-03-15 21:58:02] [INFO ] Computed and/alt/rep : 193/309/193 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-15 21:58:04] [INFO ] Added : 182 causal constraints over 37 iterations in 1225 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 19 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 21:58:04] [INFO ] Invariant cache hit.
[2023-03-15 21:58:04] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-15 21:58:04] [INFO ] Invariant cache hit.
[2023-03-15 21:58:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:04] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-15 21:58:04] [INFO ] Invariant cache hit.
[2023-03-15 21:58:05] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 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 p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 51 ms :[(NOT p2)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 187 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 51 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p2)]
[2023-03-15 21:58:05] [INFO ] Invariant cache hit.
[2023-03-15 21:58:06] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-15 21:58:06] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-15 21:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:06] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-15 21:58:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 21:58:06] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 21:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:06] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-15 21:58:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:06] [INFO ] [Nat]Added 68 Read/Feed constraints in 53 ms returned sat
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2015 ms
[2023-03-15 21:58:08] [INFO ] Computed and/alt/rep : 193/309/193 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-15 21:58:10] [INFO ] Added : 182 causal constraints over 37 iterations in 1208 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
Product exploration explored 100000 steps with 1388 reset in 184 ms.
Product exploration explored 100000 steps with 1389 reset in 225 ms.
Built C files in :
/tmp/ltsmin12163211216990112065
[2023-03-15 21:58:10] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2023-03-15 21:58:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:58:10] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2023-03-15 21:58:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:58:10] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2023-03-15 21:58:10] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:58:10] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12163211216990112065
Running compilation step : cd /tmp/ltsmin12163211216990112065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 702 ms.
Running link step : cd /tmp/ltsmin12163211216990112065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12163211216990112065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13094673308011024550.hoa' '--buchi-type=spotba'
LTSmin run took 910 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-04 finished in 16451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((G(p1)||X(p2))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 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 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 138 place count 129 transition count 128
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 140 place count 128 transition count 127
Applied a total of 140 rules in 31 ms. Remains 128 /198 variables (removed 70) and now considering 127/197 (removed 70) transitions.
// Phase 1: matrix 127 rows 128 cols
[2023-03-15 21:58:12] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 21:58:12] [INFO ] Implicit Places using invariants in 243 ms returned [0, 4, 7, 15, 19, 22, 39, 45, 46, 58, 77, 89, 90, 92, 113, 122]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 244 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/198 places, 127/197 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 110 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 106 transition count 121
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 80 transition count 95
Applied a total of 64 rules in 12 ms. Remains 80 /112 variables (removed 32) and now considering 95/127 (removed 32) transitions.
// Phase 1: matrix 95 rows 80 cols
[2023-03-15 21:58:12] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 21:58:12] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-15 21:58:12] [INFO ] Invariant cache hit.
[2023-03-15 21:58:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:58:13] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/198 places, 95/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 681 ms. Remains : 80/198 places, 95/197 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s44 1)), p1:(AND (EQ s13 1) (EQ s21 1)), p2:(OR (EQ s42 0) (EQ s44 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33430 reset in 168 ms.
Product exploration explored 100000 steps with 33471 reset in 163 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 (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:58:13] [INFO ] Invariant cache hit.
[2023-03-15 21:58:13] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:58:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-15 21:58:13] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 80 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 : 80/80 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-15 21:58:14] [INFO ] Invariant cache hit.
[2023-03-15 21:58:14] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-15 21:58:14] [INFO ] Invariant cache hit.
[2023-03-15 21:58:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 21:58:14] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-15 21:58:14] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 21:58:14] [INFO ] Invariant cache hit.
[2023-03-15 21:58:14] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 551 ms. Remains : 80/80 places, 95/95 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) p2), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 66 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33355 reset in 199 ms.
Product exploration explored 100000 steps with 33359 reset in 265 ms.
Built C files in :
/tmp/ltsmin5778522203883216378
[2023-03-15 21:58:16] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2023-03-15 21:58:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:58:16] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2023-03-15 21:58:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:58:16] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2023-03-15 21:58:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:58:16] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5778522203883216378
Running compilation step : cd /tmp/ltsmin5778522203883216378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin5778522203883216378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5778522203883216378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11900285341856121174.hoa' '--buchi-type=spotba'
LTSmin run took 446 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-06 finished in 4755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(G(p1))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 7 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 21:58:17] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 21:58:17] [INFO ] Implicit Places using invariants in 304 ms returned [28, 33, 34, 38, 83, 84, 97, 99, 140, 142, 144, 170, 188]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 305 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 6 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2023-03-15 21:58:17] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-15 21:58:17] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-15 21:58:17] [INFO ] Invariant cache hit.
[2023-03-15 21:58:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:18] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 977 ms. Remains : 182/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 286 ms :[p0, p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s73 1)), p1:(NEQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Stack based approach found an accepted trace after 302 steps with 0 reset with depth 303 and stack size 303 in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-07 finished in 1467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 6 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-15 21:58:18] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-15 21:58:18] [INFO ] Implicit Places using invariants in 303 ms returned [28, 33, 34, 38, 83, 84, 97, 99, 142, 144, 170]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 304 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 6 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-15 21:58:18] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 21:58:19] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-15 21:58:19] [INFO ] Invariant cache hit.
[2023-03-15 21:58:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:19] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1083 ms. Remains : 184/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s175 1) (EQ s180 1)), p1:(AND (EQ s131 1) (EQ s150 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 7142 reset in 234 ms.
Product exploration explored 100000 steps with 7142 reset in 292 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-15 21:58:21] [INFO ] Invariant cache hit.
[2023-03-15 21:58:21] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-15 21:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:22] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2023-03-15 21:58:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2023-03-15 21:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:22] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-15 21:58:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:22] [INFO ] [Nat]Added 68 Read/Feed constraints in 25 ms returned sat
[2023-03-15 21:58:22] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-15 21:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-15 21:58:22] [INFO ] Computed and/alt/rep : 193/310/193 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-15 21:58:23] [INFO ] Added : 11 causal constraints over 3 iterations in 193 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 21:58:23] [INFO ] Invariant cache hit.
[2023-03-15 21:58:23] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-15 21:58:23] [INFO ] Invariant cache hit.
[2023-03-15 21:58:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:23] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-15 21:58:23] [INFO ] Invariant cache hit.
[2023-03-15 21:58:24] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 184/184 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 : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-15 21:58:24] [INFO ] Invariant cache hit.
[2023-03-15 21:58:25] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-15 21:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:25] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-15 21:58:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:58:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 21:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:58:26] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-15 21:58:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 21:58:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2023-03-15 21:58:26] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-15 21:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-15 21:58:26] [INFO ] Computed and/alt/rep : 193/310/193 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-15 21:58:26] [INFO ] Added : 11 causal constraints over 3 iterations in 201 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7142 reset in 239 ms.
Product exploration explored 100000 steps with 7142 reset in 288 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 184 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 32 place count 184 transition count 194
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 45 place count 184 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 176 transition count 186
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 176 transition count 186
Performed 43 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 43 rules applied. Total rules applied 104 place count 176 transition count 186
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 127 place count 153 transition count 163
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 150 place count 153 transition count 163
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 150 rules in 45 ms. Remains 153 /184 variables (removed 31) and now considering 163/194 (removed 31) transitions.
[2023-03-15 21:58:27] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-15 21:58:27] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 21:58:27] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/184 places, 163/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 153/184 places, 163/194 transitions.
Built C files in :
/tmp/ltsmin12430282360562418109
[2023-03-15 21:58:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12430282360562418109
Running compilation step : cd /tmp/ltsmin12430282360562418109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 678 ms.
Running link step : cd /tmp/ltsmin12430282360562418109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12430282360562418109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11833852575237617867.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-13 finished in 10181 ms.
All properties solved by simple procedures.
Total runtime 61408 ms.

BK_STOP 1678917509807

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-1, 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 r261-smll-167863536300372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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