fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r065-tajo-171620414400103
Last Updated
July 7, 2024

About the Execution of 2023-gold for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
490.271 20902.00 34301.00 98.10 FTTFFTTTFFFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414400103.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414400103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.8K Apr 13 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 13 01:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 13 01:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-PT-V04P05N02-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716629903848

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=BridgeAndVehicles-PT-V04P05N02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 09:38:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 09:38:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:38:25] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2024-05-25 09:38:25] [INFO ] Transformed 28 places.
[2024-05-25 09:38:25] [INFO ] Transformed 52 transitions.
[2024-05-25 09:38:25] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 94 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 2 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 10 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:25] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:38:25] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 09:38:25] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
[2024-05-25 09:38:25] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:25] [INFO ] Invariant cache hit.
[2024-05-25 09:38:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 09:38:25] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:25] [INFO ] Invariant cache hit.
[2024-05-25 09:38:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:25] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-25 09:38:25] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:25] [INFO ] Invariant cache hit.
[2024-05-25 09:38:26] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 52/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 26/28 places, 52/52 transitions.
Support contains 24 out of 26 places after structural reductions.
[2024-05-25 09:38:26] [INFO ] Flatten gal took : 21 ms
[2024-05-25 09:38:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 09:38:26] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 09:38:26] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:26] [INFO ] Invariant cache hit.
[2024-05-25 09:38:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:38:26] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:38:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 09:38:26] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:38:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:26] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:38:26] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 4 ms to minimize.
[2024-05-25 09:38:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2024-05-25 09:38:26] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-25 09:38:26] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 20 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(X((p0&&X(G(p1))))))'
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:27] [INFO ] Invariant cache hit.
[2024-05-25 09:38:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2024-05-25 09:38:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:27] [INFO ] Invariant cache hit.
[2024-05-25 09:38:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 09:38:27] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:27] [INFO ] Invariant cache hit.
[2024-05-25 09:38:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 24/26 places, 52/52 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 282 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 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=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(GEQ s6 1), p1:(OR (AND (GEQ s11 1) (GEQ s20 1)) (AND (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s13 1) (GEQ s20 1)) (AND (GEQ s1...], 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 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 11 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:27] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
[2024-05-25 09:38:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:27] [INFO ] Invariant cache hit.
[2024-05-25 09:38:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 09:38:27] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:27] [INFO ] Invariant cache hit.
[2024-05-25 09:38:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 112 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s7 5) (LT s17 1)) (OR (LT s7 5) (LT s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4731 reset in 297 ms.
Product exploration explored 100000 steps with 4743 reset in 220 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 09:38:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2024-05-25 09:38:29] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 09:38:29] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
[2024-05-25 09:38:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:29] [INFO ] Invariant cache hit.
[2024-05-25 09:38:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-25 09:38:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:29] [INFO ] Invariant cache hit.
[2024-05-25 09:38:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-25 09:38:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 09:38:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:29] [INFO ] Invariant cache hit.
[2024-05-25 09:38:29] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 23/23 places, 51/51 transitions.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4739 reset in 163 ms.
Product exploration explored 100000 steps with 4831 reset in 142 ms.
Built C files in :
/tmp/ltsmin4026090589076333164
[2024-05-25 09:38:30] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 09:38:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:30] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 09:38:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:30] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 09:38:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:30] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4026090589076333164
Running compilation step : cd /tmp/ltsmin4026090589076333164;'/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 322 ms.
Running link step : cd /tmp/ltsmin4026090589076333164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4026090589076333164;'/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/stateBased13056334875694898814.hoa' '--buchi-type=spotba'
LTSmin run took 170 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-01 finished in 3274 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)||G(p1))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:38:30] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-25 09:38:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:30] [INFO ] Invariant cache hit.
[2024-05-25 09:38:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 09:38:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:30] [INFO ] Invariant cache hit.
[2024-05-25 09:38:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:31] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (OR (LT s7 5) (LT s18 1)) (OR (LT s7 5) (LT s19 1)))], nbAcceptance=2, 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 2348 reset in 294 ms.
Product exploration explored 100000 steps with 2347 reset in 245 ms.
Computed a total of 15 stabilizing places and 20 stable transitions
Computed a total of 15 stabilizing places and 20 stable transitions
Detected a total of 15/24 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 182 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:38:31] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2024-05-25 09:38:31] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 09:38:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:31] [INFO ] After 26ms 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 p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 339 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Support contains 3 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:32] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:32] [INFO ] Invariant cache hit.
[2024-05-25 09:38:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2024-05-25 09:38:32] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:32] [INFO ] Invariant cache hit.
[2024-05-25 09:38:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 09:38:32] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:32] [INFO ] Invariant cache hit.
[2024-05-25 09:38:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:32] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-25 09:38:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 09:38:32] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:32] [INFO ] Invariant cache hit.
[2024-05-25 09:38:32] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 24/24 places, 52/52 transitions.
Computed a total of 15 stabilizing places and 20 stable transitions
Computed a total of 15 stabilizing places and 20 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2349 reset in 144 ms.
Product exploration explored 100000 steps with 2347 reset in 153 ms.
Built C files in :
/tmp/ltsmin12723902864198539398
[2024-05-25 09:38:33] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-25 09:38:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:33] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-25 09:38:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:33] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-25 09:38:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12723902864198539398
Running compilation step : cd /tmp/ltsmin12723902864198539398;'/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 194 ms.
Running link step : cd /tmp/ltsmin12723902864198539398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12723902864198539398;'/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/stateBased4507125277063141394.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 finished in 2861 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' '!(((!p0 U F(p1)) U G((F(X(!p0)) U p2))))'
Support contains 15 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:33] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:33] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 09:38:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-25 09:38:33] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:33] [INFO ] Invariant cache hit.
[2024-05-25 09:38:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 09:38:33] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:33] [INFO ] Invariant cache hit.
[2024-05-25 09:38:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/26 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 24/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 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 p2 (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s7 5) (GEQ s18 1)) (AND (GEQ s7 5) (GEQ s19 1)))) (OR (AND (GEQ s7 1) (GEQ s9 1) (GEQ s11 1) (GEQ s15 1)) (AND (GEQ s7 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6608 reset in 310 ms.
Product exploration explored 100000 steps with 6615 reset in 295 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Detected a total of 15/24 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 314 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 268 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
Finished random walk after 17 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F p2)]
Knowledge based reduction with 13 factoid took 761 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 243 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
[2024-05-25 09:38:36] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2024-05-25 09:38:36] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:36] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 09:38:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:38:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 09:38:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2024-05-25 09:38:36] [INFO ] Computed and/alt/rep : 24/103/24 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-25 09:38:36] [INFO ] Added : 17 causal constraints over 4 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 15 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 09:38:36] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:36] [INFO ] Invariant cache hit.
[2024-05-25 09:38:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-25 09:38:36] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:36] [INFO ] Invariant cache hit.
[2024-05-25 09:38:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 09:38:36] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:36] [INFO ] Invariant cache hit.
[2024-05-25 09:38:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-25 09:38:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 09:38:36] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:36] [INFO ] Invariant cache hit.
[2024-05-25 09:38:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 24/24 places, 51/51 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Detected a total of 15/24 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 212 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 269 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
Finished random walk after 17 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F p2)]
Knowledge based reduction with 13 factoid took 690 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 195 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
[2024-05-25 09:38:38] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:38] [INFO ] Invariant cache hit.
[2024-05-25 09:38:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 09:38:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:38:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 09:38:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:38] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2024-05-25 09:38:38] [INFO ] Computed and/alt/rep : 24/103/24 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-25 09:38:38] [INFO ] Added : 16 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (AND (NOT p1) p0 p2), (NOT p2), (AND (NOT p1) p0), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 6616 reset in 296 ms.
Product exploration explored 100000 steps with 6575 reset in 257 ms.
Built C files in :
/tmp/ltsmin10381918302411997549
[2024-05-25 09:38:39] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 09:38:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:39] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 09:38:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:39] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 09:38:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:39] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10381918302411997549
Running compilation step : cd /tmp/ltsmin10381918302411997549;'/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 156 ms.
Running link step : cd /tmp/ltsmin10381918302411997549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10381918302411997549;'/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/stateBased16049984027501159044.hoa' '--buchi-type=spotba'
LTSmin run took 95 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 finished in 6085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:38:39] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 09:38:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-25 09:38:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:39] [INFO ] Invariant cache hit.
[2024-05-25 09:38:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 09:38:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:39] [INFO ] Invariant cache hit.
[2024-05-25 09:38:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s17 1) (OR (AND (GEQ s1 1) (GEQ s8 1) (GEQ s14 1) (GEQ s21 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s14 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s8 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:40] [INFO ] Invariant cache hit.
[2024-05-25 09:38:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:40] [INFO ] Invariant cache hit.
[2024-05-25 09:38:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 116 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Product exploration explored 100000 steps with 33333 reset in 151 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 finished in 557 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(G(p1)) U p2)||p0))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:38:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:40] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:40] [INFO ] Invariant cache hit.
[2024-05-25 09:38:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:40] [INFO ] Invariant cache hit.
[2024-05-25 09:38:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1)), p2:(GEQ s17 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-09 finished in 341 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 7 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:40] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 09:38:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [6, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 84 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s16 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 37 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-10 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:38:41] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 09:38:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:41] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Product exploration explored 100000 steps with 33333 reset in 93 ms.
Computed a total of 15 stabilizing places and 20 stable transitions
Computed a total of 15 stabilizing places and 20 stable transitions
Detected a total of 15/24 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 finished in 470 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((G(!p0) U X(!p1)))))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 09:38:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:41] [INFO ] Invariant cache hit.
[2024-05-25 09:38:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 25/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 219 ms :[p1, p1, p1, p1, true, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s7 1) (AND (GEQ s0 1) (GEQ s2 1))), p1:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-12 finished in 393 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' '!(((p0 U X(G(p0))) U p1))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:42] [INFO ] Invariant cache hit.
[2024-05-25 09:38:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:42] [INFO ] Invariant cache hit.
[2024-05-25 09:38:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:42] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 108 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s7 5) (GEQ s17 1))) (GEQ s2 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1)), p0:(AND (GEQ s7 5) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-13 finished in 307 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(p1)||X(G(p2))||p0))))'
Support contains 11 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:38:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:42] [INFO ] Invariant cache hit.
[2024-05-25 09:38:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:42] [INFO ] Invariant cache hit.
[2024-05-25 09:38:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 25/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=5, aps=[p0:(OR (GEQ s18 1) (GEQ s7 1) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s8 1) (GEQ s9 1))), p1:(AND (GEQ s0 1) (GEQ s2 1)), p2:(OR (LT s3 1) (LT s10 1) (LT s11 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4458 steps with 104 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 finished in 376 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 6 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:42] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 09:38:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:42] [INFO ] Invariant cache hit.
[2024-05-25 09:38:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-25 09:38:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:42] [INFO ] Invariant cache hit.
[2024-05-25 09:38:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:42] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 132 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 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 2589 reset in 150 ms.
Product exploration explored 100000 steps with 2591 reset in 125 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[p0]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 09:38:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2024-05-25 09:38:43] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 09:38:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-25 09:38:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:43] [INFO ] Invariant cache hit.
[2024-05-25 09:38:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 09:38:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:43] [INFO ] Invariant cache hit.
[2024-05-25 09:38:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-25 09:38:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 09:38:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:43] [INFO ] Invariant cache hit.
[2024-05-25 09:38:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 23/23 places, 51/51 transitions.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
Product exploration explored 100000 steps with 2592 reset in 105 ms.
Product exploration explored 100000 steps with 2591 reset in 98 ms.
Built C files in :
/tmp/ltsmin18244497899366339319
[2024-05-25 09:38:44] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 09:38:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:44] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 09:38:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:44] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 09:38:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18244497899366339319
Running compilation step : cd /tmp/ltsmin18244497899366339319;'/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 128 ms.
Running link step : cd /tmp/ltsmin18244497899366339319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin18244497899366339319;'/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/stateBased13353549800521905722.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLFireability-15 finished in 1898 ms.
All properties solved by simple procedures.
Total runtime 19117 ms.

BK_STOP 1716629924750

--------------------
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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r065-tajo-171620414400103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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