Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716215673199

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 14:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:34:35] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-20 14:34:35] [INFO ] Transformed 1042 places.
[2024-05-20 14:34:35] [INFO ] Transformed 1760 transitions.
[2024-05-20 14:34:35] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 350 places :
Symmetric choice reduction at 0 with 350 rule applications. Total rules 350 place count 692 transition count 1060
Iterating global reduction 0 with 350 rules applied. Total rules applied 700 place count 692 transition count 1060
Applied a total of 700 rules in 123 ms. Remains 692 /1042 variables (removed 350) and now considering 1060/1760 (removed 700) transitions.
// Phase 1: matrix 1060 rows 692 cols
[2024-05-20 14:34:35] [INFO ] Computed 41 invariants in 24 ms
[2024-05-20 14:34:35] [INFO ] Implicit Places using invariants in 529 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 558 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 674/1042 places, 1060/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 656 transition count 1042
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 656 transition count 1042
Applied a total of 36 rules in 62 ms. Remains 656 /674 variables (removed 18) and now considering 1042/1060 (removed 18) transitions.
// Phase 1: matrix 1042 rows 656 cols
[2024-05-20 14:34:36] [INFO ] Computed 23 invariants in 6 ms
[2024-05-20 14:34:36] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-20 14:34:36] [INFO ] Invariant cache hit.
[2024-05-20 14:34:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:38] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 656/1042 places, 1042/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2820 ms. Remains : 656/1042 places, 1042/1760 transitions.
Support contains 45 out of 656 places after structural reductions.
[2024-05-20 14:34:38] [INFO ] Flatten gal took : 96 ms
[2024-05-20 14:34:38] [INFO ] Flatten gal took : 50 ms
[2024-05-20 14:34:38] [INFO ] Input system was already deterministic with 1042 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-20 14:34:39] [INFO ] Invariant cache hit.
[2024-05-20 14:34:39] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-05-20 14:34:39] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 14:34:39] [INFO ] After 240ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 14:34:39] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:39] [INFO ] After 128ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:34:39] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:34:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-05-20 14:34:39] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 14:34:40] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:34:40] [INFO ] After 141ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:34:40] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-20 14:34:40] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 63 stabilizing places and 82 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 62 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:34:40] [INFO ] Computed 23 invariants in 11 ms
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants in 272 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 280 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 47 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:34:41] [INFO ] Computed 21 invariants in 7 ms
[2024-05-20 14:34:41] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-20 14:34:41] [INFO ] Invariant cache hit.
[2024-05-20 14:34:41] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:43] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2489 ms. Remains : 642/656 places, 1020/1042 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s90 1) (GEQ s306 1) (OR (LT s90 1) (LT s306 1) (LT s186 1) (LT s600 1))), p1:(OR (LT s90 1) (LT s306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 298 reset in 398 ms.
Product exploration explored 100000 steps with 302 reset in 327 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 14:34:44] [INFO ] Invariant cache hit.
[2024-05-20 14:34:45] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-05-20 14:34:45] [INFO ] After 273ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-20 14:34:45] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:45] [INFO ] After 91ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 14:34:45] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 14:34:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-20 14:34:45] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-20 14:34:45] [INFO ] After 100ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-20 14:34:45] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-20 14:34:45] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1020/1020 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 642 transition count 880
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 502 transition count 880
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 280 place count 502 transition count 860
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 482 transition count 860
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 356 place count 464 transition count 842
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 358 place count 464 transition count 840
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 360 place count 462 transition count 840
Applied a total of 360 rules in 154 ms. Remains 462 /642 variables (removed 180) and now considering 840/1020 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 462/642 places, 840/1020 transitions.
Finished random walk after 5345 steps, including 39 resets, run visited all 1 properties in 38 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1020/1020 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 642 transition count 880
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 502 transition count 880
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 280 place count 502 transition count 860
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 482 transition count 860
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 356 place count 464 transition count 842
Applied a total of 356 rules in 64 ms. Remains 464 /642 variables (removed 178) and now considering 842/1020 (removed 178) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 14:34:46] [INFO ] Computed 21 invariants in 5 ms
[2024-05-20 14:34:47] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-20 14:34:47] [INFO ] Invariant cache hit.
[2024-05-20 14:34:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:48] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2024-05-20 14:34:48] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-20 14:34:48] [INFO ] Invariant cache hit.
[2024-05-20 14:34:49] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 464/642 places, 842/1020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2237 ms. Remains : 464/642 places, 842/1020 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 14:34:49] [INFO ] Invariant cache hit.
[2024-05-20 14:34:49] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-20 14:34:49] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-20 14:34:49] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:49] [INFO ] After 85ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 14:34:49] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 14:34:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-20 14:34:50] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-20 14:34:50] [INFO ] After 84ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-20 14:34:50] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-20 14:34:50] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 10 factoid took 208 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 764 reset in 375 ms.
Product exploration explored 100000 steps with 756 reset in 392 ms.
Built C files in :
/tmp/ltsmin803140933305606754
[2024-05-20 14:34:51] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:34:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:34:51] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:34:51] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:34:52] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:34:52] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:34:52] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin803140933305606754
Running compilation step : cd /tmp/ltsmin803140933305606754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2250 ms.
Running link step : cd /tmp/ltsmin803140933305606754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin803140933305606754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased120125619719396609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 40 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-20 14:35:07] [INFO ] Invariant cache hit.
[2024-05-20 14:35:07] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-20 14:35:07] [INFO ] Invariant cache hit.
[2024-05-20 14:35:07] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:35:08] [INFO ] Implicit Places using invariants and state equation in 1516 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-20 14:35:08] [INFO ] Redundant transitions in 113 ms returned []
[2024-05-20 14:35:08] [INFO ] Invariant cache hit.
[2024-05-20 14:35:09] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2240 ms. Remains : 464/464 places, 842/842 transitions.
Built C files in :
/tmp/ltsmin8333978711573506676
[2024-05-20 14:35:09] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:35:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:35:09] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:35:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:35:09] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:35:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:35:09] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8333978711573506676
Running compilation step : cd /tmp/ltsmin8333978711573506676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2136 ms.
Running link step : cd /tmp/ltsmin8333978711573506676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8333978711573506676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6283126856067787754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 14:35:24] [INFO ] Flatten gal took : 35 ms
[2024-05-20 14:35:24] [INFO ] Flatten gal took : 33 ms
[2024-05-20 14:35:24] [INFO ] Time to serialize gal into /tmp/LTL9557064420861849392.gal : 6 ms
[2024-05-20 14:35:24] [INFO ] Time to serialize properties into /tmp/LTL16900983992789956293.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9557064420861849392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16221329965802487025.hoa' '-atoms' '/tmp/LTL16900983992789956293.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16900983992789956293.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16221329965802487025.hoa
Detected timeout of ITS tools.
[2024-05-20 14:35:39] [INFO ] Flatten gal took : 28 ms
[2024-05-20 14:35:39] [INFO ] Flatten gal took : 25 ms
[2024-05-20 14:35:39] [INFO ] Time to serialize gal into /tmp/LTL18142386963060722834.gal : 3 ms
[2024-05-20 14:35:39] [INFO ] Time to serialize properties into /tmp/LTL17017904923504134204.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18142386963060722834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17017904923504134204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((Node7IsInserted<1)||(Node2requestsent7<1))")))||("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
Detected timeout of ITS tools.
[2024-05-20 14:35:54] [INFO ] Flatten gal took : 24 ms
[2024-05-20 14:35:54] [INFO ] Applying decomposition
[2024-05-20 14:35:54] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1099860713925309460.txt' '-o' '/tmp/graph1099860713925309460.bin' '-w' '/tmp/graph1099860713925309460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1099860713925309460.bin' '-l' '-1' '-v' '-w' '/tmp/graph1099860713925309460.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:35:54] [INFO ] Decomposing Gal with order
[2024-05-20 14:35:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:35:55] [INFO ] Removed a total of 769 redundant transitions.
[2024-05-20 14:35:55] [INFO ] Flatten gal took : 197 ms
[2024-05-20 14:35:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 33 ms.
[2024-05-20 14:35:55] [INFO ] Time to serialize gal into /tmp/LTL16078114609608540335.gal : 9 ms
[2024-05-20 14:35:55] [INFO ] Time to serialize properties into /tmp/LTL15301948828223359023.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16078114609608540335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15301948828223359023.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((u1.Node7IsInserted<1)||(u2.Node2requestsent7<1))")))||("(((u1.Node7IsInserted>=1)&&(u2.Node2requestsent7>=1))&&(((u1.No...263
Formula 0 simplified : XG(!"(((u1.Node7IsInserted>=1)&&(u2.Node2requestsent7>=1))&&(((u1.Node7IsInserted<1)||(u2.Node2requestsent7<1))||((u18.Node15IsInser...253
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14449350421386267321
[2024-05-20 14:36:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14449350421386267321
Running compilation step : cd /tmp/ltsmin14449350421386267321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1256 ms.
Running link step : cd /tmp/ltsmin14449350421386267321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14449350421386267321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp0==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 104575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 308 place count 497 transition count 873
Iterating global reduction 2 with 10 rules applied. Total rules applied 318 place count 497 transition count 873
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 327 place count 497 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 336 place count 488 transition count 864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 73 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-20 14:36:25] [INFO ] Computed 23 invariants in 4 ms
[2024-05-20 14:36:25] [INFO ] Implicit Places using invariants in 231 ms returned [28, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 234 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 24 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 14:36:25] [INFO ] Computed 21 invariants in 4 ms
[2024-05-20 14:36:25] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-20 14:36:25] [INFO ] Invariant cache hit.
[2024-05-20 14:36:26] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:27] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2088 ms. Remains : 464/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s180 1)) (AND (GEQ s17 1) (GEQ s373 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-02 finished in 2157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 647 transition count 1024
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 647 transition count 1024
Applied a total of 18 rules in 25 ms. Remains 647 /656 variables (removed 9) and now considering 1024/1042 (removed 18) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2024-05-20 14:36:27] [INFO ] Computed 23 invariants in 10 ms
[2024-05-20 14:36:27] [INFO ] Implicit Places using invariants in 267 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1024/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 645 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 645 transition count 1023
Applied a total of 2 rules in 20 ms. Remains 645 /646 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2024-05-20 14:36:27] [INFO ] Computed 22 invariants in 9 ms
[2024-05-20 14:36:28] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-20 14:36:28] [INFO ] Invariant cache hit.
[2024-05-20 14:36:28] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:29] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1023/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2375 ms. Remains : 645/656 places, 1023/1042 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s413 1), p0:(OR (AND (GEQ s104 1) (GEQ s133 1)) (AND (GEQ s96 1) (GEQ s97 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5980 steps with 16 reset in 23 ms.
FORMULA CANConstruction-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-03 finished in 2575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 23 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:36:30] [INFO ] Computed 23 invariants in 9 ms
[2024-05-20 14:36:30] [INFO ] Implicit Places using invariants in 263 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 18 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:36:30] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:36:30] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-20 14:36:30] [INFO ] Invariant cache hit.
[2024-05-20 14:36:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:32] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2381 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s138 1) (GEQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 427 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-05 finished in 2477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 372 place count 470 transition count 847
Applied a total of 372 rules in 61 ms. Remains 470 /656 variables (removed 186) and now considering 847/1042 (removed 195) transitions.
// Phase 1: matrix 847 rows 470 cols
[2024-05-20 14:36:32] [INFO ] Computed 23 invariants in 8 ms
[2024-05-20 14:36:32] [INFO ] Implicit Places using invariants in 231 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 847/1042 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 843
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 843
Applied a total of 8 rules in 32 ms. Remains 464 /468 variables (removed 4) and now considering 843/847 (removed 4) transitions.
// Phase 1: matrix 843 rows 464 cols
[2024-05-20 14:36:32] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:36:33] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-20 14:36:33] [INFO ] Invariant cache hit.
[2024-05-20 14:36:33] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:34] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 843/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2175 ms. Remains : 464/656 places, 843/1042 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s391 1) (AND (GEQ s22 1) (GEQ s451 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]]
Stuttering criterion allowed to conclude after 216 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-06 finished in 2234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 26 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:36:34] [INFO ] Computed 23 invariants in 9 ms
[2024-05-20 14:36:35] [INFO ] Implicit Places using invariants in 253 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 255 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 19 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:36:35] [INFO ] Computed 21 invariants in 5 ms
[2024-05-20 14:36:35] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-20 14:36:35] [INFO ] Invariant cache hit.
[2024-05-20 14:36:35] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:37] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2449 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s27 1) (AND (GEQ s6 1) (GEQ s395 1))), p1:(AND (GEQ s6 1) (GEQ s395 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 427 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-08 finished in 2558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!(p0 U p1)))||!(p0 U !p0)))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 27 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-20 14:36:37] [INFO ] Computed 23 invariants in 11 ms
[2024-05-20 14:36:37] [INFO ] Implicit Places using invariants in 272 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 273 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1026/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 19 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2024-05-20 14:36:37] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:36:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-20 14:36:37] [INFO ] Invariant cache hit.
[2024-05-20 14:36:38] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:39] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/656 places, 1024/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2536 ms. Remains : 644/656 places, 1024/1042 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s550 1), p1:(GEQ s463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 613 ms.
Product exploration explored 100000 steps with 50000 reset in 617 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-09 finished in 4020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 26 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:36:41] [INFO ] Computed 23 invariants in 8 ms
[2024-05-20 14:36:41] [INFO ] Implicit Places using invariants in 266 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 269 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 18 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:36:41] [INFO ] Computed 21 invariants in 9 ms
[2024-05-20 14:36:41] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-20 14:36:42] [INFO ] Invariant cache hit.
[2024-05-20 14:36:42] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:43] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2418 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (LT s150 1) (LT s349 1)), p1:(LT s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-10 finished in 2595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 374 place count 469 transition count 846
Applied a total of 374 rules in 56 ms. Remains 469 /656 variables (removed 187) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 469 cols
[2024-05-20 14:36:44] [INFO ] Computed 23 invariants in 4 ms
[2024-05-20 14:36:44] [INFO ] Implicit Places using invariants in 235 ms returned [26, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/656 places, 846/1042 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 467 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 463 transition count 842
Applied a total of 8 rules in 16 ms. Remains 463 /467 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 463 cols
[2024-05-20 14:36:44] [INFO ] Computed 21 invariants in 4 ms
[2024-05-20 14:36:44] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-20 14:36:44] [INFO ] Invariant cache hit.
[2024-05-20 14:36:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:46] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 463/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2157 ms. Remains : 463/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s230 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 739 reset in 387 ms.
Stack based approach found an accepted trace after 23031 steps with 170 reset with depth 61 and stack size 61 in 89 ms.
FORMULA CANConstruction-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-12 finished in 2702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((F(p2)||p1))))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 649 transition count 1028
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 649 transition count 1028
Applied a total of 14 rules in 24 ms. Remains 649 /656 variables (removed 7) and now considering 1028/1042 (removed 14) transitions.
// Phase 1: matrix 1028 rows 649 cols
[2024-05-20 14:36:46] [INFO ] Computed 23 invariants in 9 ms
[2024-05-20 14:36:47] [INFO ] Implicit Places using invariants in 262 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1028/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 645 transition count 1026
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 645 transition count 1026
Applied a total of 4 rules in 19 ms. Remains 645 /647 variables (removed 2) and now considering 1026/1028 (removed 2) transitions.
// Phase 1: matrix 1026 rows 645 cols
[2024-05-20 14:36:47] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:36:47] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-20 14:36:47] [INFO ] Invariant cache hit.
[2024-05-20 14:36:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:49] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1026/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2475 ms. Remains : 645/656 places, 1026/1042 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LT s323 1), p1:(OR (GEQ s394 1) (GEQ s505 1)), p2:(AND (GEQ s59 1) (GEQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 591 ms.
Product exploration explored 100000 steps with 50000 reset in 607 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 35 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-13 finished in 3933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(F(!p0))||G(!p1)) U p2))))'
Support contains 7 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 656 transition count 915
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 529 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 528 transition count 914
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 256 place count 528 transition count 896
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 292 place count 510 transition count 896
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 500 transition count 876
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 500 transition count 876
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 320 place count 500 transition count 868
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 328 place count 492 transition count 868
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 362 place count 475 transition count 851
Applied a total of 362 rules in 57 ms. Remains 475 /656 variables (removed 181) and now considering 851/1042 (removed 191) transitions.
// Phase 1: matrix 851 rows 475 cols
[2024-05-20 14:36:50] [INFO ] Computed 23 invariants in 16 ms
[2024-05-20 14:36:51] [INFO ] Implicit Places using invariants in 318 ms returned [27, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 319 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/656 places, 851/1042 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 473 transition count 847
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 469 transition count 847
Applied a total of 8 rules in 18 ms. Remains 469 /473 variables (removed 4) and now considering 847/851 (removed 4) transitions.
// Phase 1: matrix 847 rows 469 cols
[2024-05-20 14:36:51] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:36:51] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-20 14:36:51] [INFO ] Invariant cache hit.
[2024-05-20 14:36:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:52] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 469/656 places, 847/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2274 ms. Remains : 469/656 places, 847/1042 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p0 p1), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(OR (AND p2 p0) (AND p0 (NOT p1))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s47 1)), p1:(AND (GEQ s29 1) (GEQ s401 1)), p0:(AND (GEQ s56 1) (GEQ s43 1) (GEQ s61 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 703 reset in 379 ms.
Product exploration explored 100000 steps with 703 reset in 381 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 273 ms. Reduced automaton from 7 states, 30 edges and 3 AP (stutter insensitive) to 7 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 14:36:54] [INFO ] Invariant cache hit.
[2024-05-20 14:36:54] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-20 14:36:54] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F p2), (F (AND (NOT p1) p2 p0)), (F (OR (AND (NOT p1) p0) (AND p2 p0))), (F p0)]
Knowledge based reduction with 27 factoid took 1043 ms. Reduced automaton from 7 states, 29 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-20 14:36:56] [INFO ] Invariant cache hit.
[2024-05-20 14:36:56] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-20 14:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:36:57] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2024-05-20 14:36:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:36:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-20 14:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:36:58] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-05-20 14:36:58] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:36:58] [INFO ] [Nat]Added 780 Read/Feed constraints in 128 ms returned sat
[2024-05-20 14:36:58] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 46 ms.
[2024-05-20 14:36:59] [INFO ] Added : 46 causal constraints over 10 iterations in 730 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 847/847 transitions.
Applied a total of 0 rules in 14 ms. Remains 469 /469 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-20 14:36:59] [INFO ] Invariant cache hit.
[2024-05-20 14:36:59] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-20 14:36:59] [INFO ] Invariant cache hit.
[2024-05-20 14:36:59] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:01] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2024-05-20 14:37:01] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-20 14:37:01] [INFO ] Invariant cache hit.
[2024-05-20 14:37:01] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2267 ms. Remains : 469/469 places, 847/847 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 14:37:02] [INFO ] Invariant cache hit.
[2024-05-20 14:37:02] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-20 14:37:02] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p0)), (F p2), (F p1)]
Knowledge based reduction with 12 factoid took 330 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-20 14:37:02] [INFO ] Invariant cache hit.
[2024-05-20 14:37:03] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-20 14:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:37:03] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2024-05-20 14:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:37:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-20 14:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:37:04] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2024-05-20 14:37:04] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:05] [INFO ] [Nat]Added 780 Read/Feed constraints in 135 ms returned sat
[2024-05-20 14:37:05] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 47 ms.
[2024-05-20 14:37:05] [INFO ] Added : 46 causal constraints over 10 iterations in 594 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 695 reset in 361 ms.
Product exploration explored 100000 steps with 690 reset in 375 ms.
Built C files in :
/tmp/ltsmin5104772928325750078
[2024-05-20 14:37:06] [INFO ] Computing symmetric may disable matrix : 847 transitions.
[2024-05-20 14:37:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:06] [INFO ] Computing symmetric may enable matrix : 847 transitions.
[2024-05-20 14:37:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:06] [INFO ] Computing Do-Not-Accords matrix : 847 transitions.
[2024-05-20 14:37:06] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:06] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5104772928325750078
Running compilation step : cd /tmp/ltsmin5104772928325750078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2146 ms.
Running link step : cd /tmp/ltsmin5104772928325750078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5104772928325750078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13429179502964262113.hoa' '--buchi-type=spotba'
LTSmin run took 10369 ms.
FORMULA CANConstruction-PT-020-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-020-LTLFireability-14 finished in 28739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||F(p2)))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 26 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-20 14:37:19] [INFO ] Computed 23 invariants in 8 ms
[2024-05-20 14:37:19] [INFO ] Implicit Places using invariants in 268 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 269 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1026/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 646 transition count 1025
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 646 transition count 1025
Applied a total of 2 rules in 19 ms. Remains 646 /647 variables (removed 1) and now considering 1025/1026 (removed 1) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2024-05-20 14:37:19] [INFO ] Computed 22 invariants in 8 ms
[2024-05-20 14:37:19] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-20 14:37:19] [INFO ] Invariant cache hit.
[2024-05-20 14:37:20] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:21] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 646/656 places, 1025/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2410 ms. Remains : 646/656 places, 1025/1042 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s292 1), p1:(AND (GEQ s144 1) (GEQ s146 1)), p2:(LT s405 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 623 ms.
Product exploration explored 100000 steps with 50000 reset in 641 ms.
Computed a total of 62 stabilizing places and 81 stable transitions
Computed a total of 62 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-15 finished in 3939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : CANConstruction-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 656 transition count 912
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 526 transition count 912
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 260 place count 526 transition count 894
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 296 place count 508 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 306 place count 498 transition count 874
Iterating global reduction 2 with 10 rules applied. Total rules applied 316 place count 498 transition count 874
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 325 place count 498 transition count 865
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 334 place count 489 transition count 865
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 43 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-20 14:37:23] [INFO ] Computed 23 invariants in 3 ms
[2024-05-20 14:37:23] [INFO ] Implicit Places using invariants in 254 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 256 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 465 transition count 843
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 464 transition count 842
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 21 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 14:37:23] [INFO ] Computed 21 invariants in 3 ms
[2024-05-20 14:37:24] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-20 14:37:24] [INFO ] Invariant cache hit.
[2024-05-20 14:37:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:25] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2197 ms. Remains : 464/656 places, 842/1042 transitions.
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s128 1) (OR (LT s25 1) (LT s128 1) (LT s50 1) (LT s422 1))), p1:(OR (LT s25 1) (LT s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 762 reset in 363 ms.
Product exploration explored 100000 steps with 753 reset in 395 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 14:37:26] [INFO ] Invariant cache hit.
[2024-05-20 14:37:27] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2024-05-20 14:37:27] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-20 14:37:27] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:27] [INFO ] After 82ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 14:37:27] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 14:37:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-20 14:37:27] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-20 14:37:27] [INFO ] After 97ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-20 14:37:27] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-20 14:37:28] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 842/842 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 840
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 840
Applied a total of 4 rules in 48 ms. Remains 462 /464 variables (removed 2) and now considering 840/842 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 462/464 places, 840/842 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642958 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642958 steps, saw 131930 distinct states, run finished after 3002 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 840 rows 462 cols
[2024-05-20 14:37:31] [INFO ] Computed 21 invariants in 4 ms
[2024-05-20 14:37:31] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-20 14:37:31] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 14:37:31] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:31] [INFO ] After 70ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:37:31] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:37:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-20 14:37:31] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:37:31] [INFO ] After 80ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:37:31] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-20 14:37:31] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 840/840 transitions.
Applied a total of 0 rules in 13 ms. Remains 462 /462 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 462/462 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 840/840 transitions.
Applied a total of 0 rules in 13 ms. Remains 462 /462 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2024-05-20 14:37:31] [INFO ] Invariant cache hit.
[2024-05-20 14:37:32] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-20 14:37:32] [INFO ] Invariant cache hit.
[2024-05-20 14:37:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:33] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2024-05-20 14:37:33] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-20 14:37:33] [INFO ] Invariant cache hit.
[2024-05-20 14:37:34] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2294 ms. Remains : 462/462 places, 840/840 transitions.
Graph (trivial) has 796 edges and 462 vertex of which 418 / 462 are part of one of the 20 SCC in 2 ms
Free SCC test removed 398 places
Drop transitions removed 776 transitions
Reduce isomorphic transitions removed 776 transitions.
Graph (complete) has 125 edges and 64 vertex of which 13 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 13 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 13 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 11 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 11 transition count 10
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 9 transition count 8
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 9 transition count 8
Applied a total of 32 rules in 10 ms. Remains 9 /462 variables (removed 453) and now considering 8/840 (removed 832) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2024-05-20 14:37:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-20 14:37:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-20 14:37:34] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 14:37:34] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 14:37:34] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 37 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 14:37:34] [INFO ] Computed 21 invariants in 3 ms
[2024-05-20 14:37:35] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-20 14:37:35] [INFO ] Invariant cache hit.
[2024-05-20 14:37:35] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:36] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2024-05-20 14:37:36] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-20 14:37:36] [INFO ] Invariant cache hit.
[2024-05-20 14:37:37] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2415 ms. Remains : 464/464 places, 842/842 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 171 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 14:37:37] [INFO ] Invariant cache hit.
[2024-05-20 14:37:37] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 10 factoid took 193 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 756 reset in 362 ms.
Product exploration explored 100000 steps with 760 reset in 398 ms.
Built C files in :
/tmp/ltsmin9489205288303028298
[2024-05-20 14:37:39] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:37:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:39] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:37:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:39] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:37:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:39] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9489205288303028298
Running compilation step : cd /tmp/ltsmin9489205288303028298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2128 ms.
Running link step : cd /tmp/ltsmin9489205288303028298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9489205288303028298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12598807666884324835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 26 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-20 14:37:54] [INFO ] Invariant cache hit.
[2024-05-20 14:37:54] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-20 14:37:54] [INFO ] Invariant cache hit.
[2024-05-20 14:37:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:37:56] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2024-05-20 14:37:56] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-20 14:37:56] [INFO ] Invariant cache hit.
[2024-05-20 14:37:56] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2150 ms. Remains : 464/464 places, 842/842 transitions.
Built C files in :
/tmp/ltsmin14856993085908153031
[2024-05-20 14:37:56] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:37:56] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:56] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:37:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:56] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:37:56] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:37:56] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14856993085908153031
Running compilation step : cd /tmp/ltsmin14856993085908153031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2096 ms.
Running link step : cd /tmp/ltsmin14856993085908153031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14856993085908153031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13753439755400454562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 14:38:11] [INFO ] Flatten gal took : 25 ms
[2024-05-20 14:38:11] [INFO ] Flatten gal took : 25 ms
[2024-05-20 14:38:11] [INFO ] Time to serialize gal into /tmp/LTL5955622561807361513.gal : 4 ms
[2024-05-20 14:38:11] [INFO ] Time to serialize properties into /tmp/LTL12080811178634525383.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5955622561807361513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16457983242549447150.hoa' '-atoms' '/tmp/LTL12080811178634525383.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12080811178634525383.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16457983242549447150.hoa
Detected timeout of ITS tools.
[2024-05-20 14:38:26] [INFO ] Flatten gal took : 24 ms
[2024-05-20 14:38:26] [INFO ] Flatten gal took : 24 ms
[2024-05-20 14:38:26] [INFO ] Time to serialize gal into /tmp/LTL16554910896646791933.gal : 9 ms
[2024-05-20 14:38:26] [INFO ] Time to serialize properties into /tmp/LTL2239266719768330057.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16554910896646791933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2239266719768330057.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((Node7IsInserted<1)||(Node2requestsent7<1))")))||("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
Detected timeout of ITS tools.
[2024-05-20 14:38:41] [INFO ] Flatten gal took : 25 ms
[2024-05-20 14:38:41] [INFO ] Applying decomposition
[2024-05-20 14:38:41] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8758860821387684278.txt' '-o' '/tmp/graph8758860821387684278.bin' '-w' '/tmp/graph8758860821387684278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8758860821387684278.bin' '-l' '-1' '-v' '-w' '/tmp/graph8758860821387684278.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:38:41] [INFO ] Decomposing Gal with order
[2024-05-20 14:38:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:38:41] [INFO ] Removed a total of 769 redundant transitions.
[2024-05-20 14:38:41] [INFO ] Flatten gal took : 80 ms
[2024-05-20 14:38:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 24 ms.
[2024-05-20 14:38:42] [INFO ] Time to serialize gal into /tmp/LTL15566282110462121863.gal : 6 ms
[2024-05-20 14:38:42] [INFO ] Time to serialize properties into /tmp/LTL11027852034132269514.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15566282110462121863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11027852034132269514.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((u13.Node7IsInserted<1)||(u2.Node2requestsent7<1))")))||("(((u13.Node7IsInserted>=1)&&(u2.Node2requestsent7>=1))&&(((u13...265
Formula 0 simplified : XG(!"(((u13.Node7IsInserted>=1)&&(u2.Node2requestsent7>=1))&&(((u13.Node7IsInserted<1)||(u2.Node2requestsent7<1))||((u2.Node15IsInse...255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11506552918094794614
[2024-05-20 14:38:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11506552918094794614
Running compilation step : cd /tmp/ltsmin11506552918094794614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1302 ms.
Running link step : cd /tmp/ltsmin11506552918094794614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11506552918094794614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp0==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 108864 ms.
[2024-05-20 14:39:12] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17862870493875882086
[2024-05-20 14:39:12] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2024-05-20 14:39:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:39:12] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2024-05-20 14:39:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:39:12] [INFO ] Applying decomposition
[2024-05-20 14:39:12] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10707435859332882819.txt' '-o' '/tmp/graph10707435859332882819.bin' '-w' '/tmp/graph10707435859332882819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10707435859332882819.bin' '-l' '-1' '-v' '-w' '/tmp/graph10707435859332882819.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:39:12] [INFO ] Decomposing Gal with order
[2024-05-20 14:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:39:12] [INFO ] Removed a total of 790 redundant transitions.
[2024-05-20 14:39:12] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2024-05-20 14:39:12] [INFO ] Flatten gal took : 57 ms
[2024-05-20 14:39:12] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:39:12] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17862870493875882086
Running compilation step : cd /tmp/ltsmin17862870493875882086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 14:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1434 labels/synchronizations in 35 ms.
[2024-05-20 14:39:12] [INFO ] Time to serialize gal into /tmp/LTLFireability2959218153265927155.gal : 8 ms
[2024-05-20 14:39:12] [INFO ] Time to serialize properties into /tmp/LTLFireability8612585127747388686.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2959218153265927155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8612585127747388686.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((i6.u27.Node7IsInserted>=1)&&(i2.u10.Node2requestsent7>=1))&&(((i6.u27.Node7IsInserted<1)||(i2.u10.Node2requestsent7<1))||(...293
Formula 0 simplified : XG(!"(((i6.u27.Node7IsInserted>=1)&&(i2.u10.Node2requestsent7>=1))&&(((i6.u27.Node7IsInserted<1)||(i2.u10.Node2requestsent7<1))||((i...283
Compilation finished in 2903 ms.
Running link step : cd /tmp/ltsmin17862870493875882086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17862870493875882086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 15:00:45] [INFO ] Flatten gal took : 66 ms
[2024-05-20 15:00:45] [INFO ] Time to serialize gal into /tmp/LTLFireability350119073367721855.gal : 15 ms
[2024-05-20 15:00:45] [INFO ] Time to serialize properties into /tmp/LTLFireability2566761875445652547.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability350119073367721855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2566761875445652547.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
Detected timeout of ITS tools.
[2024-05-20 15:22:19] [INFO ] Flatten gal took : 74 ms
[2024-05-20 15:22:19] [INFO ] Input system was already deterministic with 1042 transitions.
[2024-05-20 15:22:19] [INFO ] Transformed 656 places.
[2024-05-20 15:22:19] [INFO ] Transformed 1042 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 15:22:19] [INFO ] Time to serialize gal into /tmp/LTLFireability16872338519694773100.gal : 5 ms
[2024-05-20 15:22:19] [INFO ] Time to serialize properties into /tmp/LTLFireability214807998784232818.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16872338519694773100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability214807998784232818.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.108: LTL layer: formula: X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 0/ 8), 0.109: "X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.109: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.127: buchi has 3 states
pins2lts-mc-linux64( 1/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.165: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.177: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.441: DFS-FIFO for weak LTL, using special progress label 1045
pins2lts-mc-linux64( 0/ 8), 0.441: There are 1046 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.441: State length is 657, there are 1046 groups
pins2lts-mc-linux64( 0/ 8), 0.441: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.441: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.441: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.441: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.541: ~1 levels ~960 states ~11336 transitions
pins2lts-mc-linux64( 4/ 8), 0.644: ~1 levels ~1920 states ~29576 transitions
pins2lts-mc-linux64( 1/ 8), 0.853: ~1 levels ~3840 states ~71672 transitions
pins2lts-mc-linux64( 1/ 8), 1.195: ~1 levels ~7680 states ~144632 transitions
pins2lts-mc-linux64( 0/ 8), 1.851: ~1 levels ~15360 states ~291840 transitions
pins2lts-mc-linux64( 0/ 8), 3.066: ~1 levels ~30720 states ~583680 transitions
pins2lts-mc-linux64( 0/ 8), 5.195: ~1 levels ~61440 states ~1167360 transitions
pins2lts-mc-linux64( 0/ 8), 9.240: ~1 levels ~122880 states ~2334720 transitions
pins2lts-mc-linux64( 1/ 8), 16.564: ~1 levels ~245760 states ~4668152 transitions
pins2lts-mc-linux64( 1/ 8), 30.730: ~1 levels ~491520 states ~9337592 transitions
pins2lts-mc-linux64( 1/ 8), 59.569: ~1 levels ~983040 states ~18676472 transitions
pins2lts-mc-linux64( 0/ 8), 127.406: ~1 levels ~1966080 states ~37355568 transitions
pins2lts-mc-linux64( 0/ 8), 240.169: ~1 levels ~3932160 states ~74711128 transitions
pins2lts-mc-linux64( 0/ 8), 466.325: ~1 levels ~7864320 states ~149423384 transitions
pins2lts-mc-linux64( 0/ 8), 937.292: ~1 levels ~15728640 states ~298846472 transitions
pins2lts-mc-linux64( 0/ 8), 1842.698: ~1 levels ~31457280 states ~597702096 transitions
pins2lts-mc-linux64( 6/ 8), 2628.125: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2628.150:
pins2lts-mc-linux64( 0/ 8), 2628.150: mean standard work distribution: 6.3% (states) 6.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 2628.150:
pins2lts-mc-linux64( 0/ 8), 2628.150: Explored 43426458 states 824966849 transitions, fanout: 18.997
pins2lts-mc-linux64( 0/ 8), 2628.150: Total exploration time 2627.690 sec (2627.640 sec minimum, 2627.671 sec on average)
pins2lts-mc-linux64( 0/ 8), 2628.150: States per second: 16526, Transitions per second: 313951
pins2lts-mc-linux64( 0/ 8), 2628.150:
pins2lts-mc-linux64( 0/ 8), 2628.150: Progress states detected: 134217251
pins2lts-mc-linux64( 0/ 8), 2628.150: Redundant explorations: -67.6447
pins2lts-mc-linux64( 0/ 8), 2628.150:
pins2lts-mc-linux64( 0/ 8), 2628.150: Queue width: 8B, total height: 144958341, memory: 1105.94MB
pins2lts-mc-linux64( 0/ 8), 2628.150: Tree memory: 1044.9MB, 8.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2628.150: Tree fill ratio (roots/leafs): 99.0%/8.0%
pins2lts-mc-linux64( 0/ 8), 2628.150: Stored 1241 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2628.150: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2628.150: Est. total memory use: 2150.9MB (~2129.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17862870493875882086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17862870493875882086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 637184 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15836424 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-020, 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 r087-tall-171620521300013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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