fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r037-tajo-167813690000180
Last Updated
May 14, 2023

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2789.483 509288.00 1591529.00 502.60 TFFFFTFFFFFTFFTF 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/mcc2023-input.r037-tajo-167813690000180.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P10N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690000180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 12:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K Feb 25 12:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 25 12:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 128K Feb 25 12:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 518K Feb 25 12:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 434K Mar 5 18:22 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-V20P10N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678329839192

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 02:44:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 02:44:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:44:01] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-09 02:44:01] [INFO ] Transformed 68 places.
[2023-03-09 02:44:01] [INFO ] Transformed 548 transitions.
[2023-03-09 02:44:01] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 20 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-09 02:44:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-09 02:44:01] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-09 02:44:02] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
[2023-03-09 02:44:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:02] [INFO ] Invariant cache hit.
[2023-03-09 02:44:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 02:44:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:02] [INFO ] Invariant cache hit.
[2023-03-09 02:44:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 528 ms. Remains : 65/68 places, 548/548 transitions.
Support contains 62 out of 65 places after structural reductions.
[2023-03-09 02:44:02] [INFO ] Flatten gal took : 75 ms
[2023-03-09 02:44:02] [INFO ] Flatten gal took : 52 ms
[2023-03-09 02:44:02] [INFO ] Input system was already deterministic with 548 transitions.
Finished random walk after 7105 steps, including 40 resets, run visited all 19 properties in 134 ms. (steps per millisecond=53 )
Computed a total of 48 stabilizing places and 84 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U (F(p1) U p2)))))'
Support contains 26 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-09 02:44:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2023-03-09 02:44:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 02:44:03] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
[2023-03-09 02:44:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:03] [INFO ] Invariant cache hit.
[2023-03-09 02:44:03] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 02:44:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:03] [INFO ] Invariant cache hit.
[2023-03-09 02:44:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:03] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-09 02:44:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:03] [INFO ] Invariant cache hit.
[2023-03-09 02:44:04] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 65/65 places, 548/548 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s19 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s18 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s22 1) (GEQ s24 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 3507 reset in 730 ms.
Product exploration explored 100000 steps with 3558 reset in 603 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Finished random walk after 66 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 432 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
[2023-03-09 02:44:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:07] [INFO ] Invariant cache hit.
[2023-03-09 02:44:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 02:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:07] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 02:44:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:44:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:08] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-09 02:44:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 177 ms returned sat
[2023-03-09 02:44:08] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 42 ms.
[2023-03-09 02:44:08] [INFO ] Added : 2 causal constraints over 1 iterations in 107 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 26 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-09 02:44:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:08] [INFO ] Invariant cache hit.
[2023-03-09 02:44:08] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
[2023-03-09 02:44:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:08] [INFO ] Invariant cache hit.
[2023-03-09 02:44:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 02:44:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:08] [INFO ] Invariant cache hit.
[2023-03-09 02:44:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:08] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-09 02:44:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:08] [INFO ] Invariant cache hit.
[2023-03-09 02:44:09] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 65/65 places, 548/548 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Finished random walk after 92 steps, including 0 resets, run visited all 4 properties in 13 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 400 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
[2023-03-09 02:44:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:10] [INFO ] Invariant cache hit.
[2023-03-09 02:44:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:10] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 02:44:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:44:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:11] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-09 02:44:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 178 ms returned sat
[2023-03-09 02:44:11] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 45 ms.
[2023-03-09 02:44:11] [INFO ] Added : 2 causal constraints over 1 iterations in 116 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3528 reset in 499 ms.
Product exploration explored 100000 steps with 3735 reset in 554 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 26 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 78 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-09 02:44:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:13] [INFO ] Invariant cache hit.
[2023-03-09 02:44:13] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
[2023-03-09 02:44:13] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-09 02:44:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:13] [INFO ] Invariant cache hit.
[2023-03-09 02:44:13] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 65/65 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin14364423466471051773
[2023-03-09 02:44:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14364423466471051773
Running compilation step : cd /tmp/ltsmin14364423466471051773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 923 ms.
Running link step : cd /tmp/ltsmin14364423466471051773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14364423466471051773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5651178364018367407.hoa' '--buchi-type=spotba'
LTSmin run took 7249 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-00 finished in 18679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((F(G(!p1))||G(p2)))&&p0))))'
Support contains 26 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 8 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:44:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:44:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:44:22] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
[2023-03-09 02:44:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:22] [INFO ] Invariant cache hit.
[2023-03-09 02:44:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-09 02:44:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:22] [INFO ] Invariant cache hit.
[2023-03-09 02:44:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:22] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-09 02:44:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:22] [INFO ] Invariant cache hit.
[2023-03-09 02:44:22] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/65 places, 547/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 64/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1), p1]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s19 1) (LT s22 1) (LT s24 1) (LT s25 1)) (OR (LT s18 1) (LT s22 1) (LT s24 1) (LT s25 1)) (OR (LT s9 1) (LT s22 1) (LT s24 1) (LT s25 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 176 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-01 finished in 855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&(X(p1)||F(!p2))))) U G(!p1)))'
Support contains 36 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 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 64 transition count 547
Applied a total of 2 rules in 38 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:44:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:44:22] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 02:44:23] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
[2023-03-09 02:44:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:23] [INFO ] Invariant cache hit.
[2023-03-09 02:44:23] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 02:44:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:23] [INFO ] Invariant cache hit.
[2023-03-09 02:44:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:23] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/65 places, 547/548 transitions.
Applied a total of 0 rules in 46 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 596 ms. Remains : 63/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 205 ms :[p1, (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s47 1) (LT s62 1)) (OR (LT s46 1) (LT s62 1))), p0:(GEQ s48 1), p2:(OR (AND (GEQ s10 1) (GEQ s24 1) (GEQ s25 1) (GEQ s54 1)) (AND (GEQ s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2020 reset in 194 ms.
Product exploration explored 100000 steps with 2010 reset in 260 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X p1), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 586 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[p1, (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 02:44:25] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-09 02:44:25] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 02:44:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:44:25] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 02:44:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:44:25] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X p1), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND (NOT p1) p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT p1)), (F (AND p0 p2)), (F p0)]
Knowledge based reduction with 12 factoid took 671 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[p1, (NOT p0)]
[2023-03-09 02:44:26] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:26] [INFO ] Invariant cache hit.
[2023-03-09 02:44:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-09 02:44:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:44:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:27] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-09 02:44:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 224 ms returned sat
[2023-03-09 02:44:27] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 46 ms.
[2023-03-09 02:44:27] [INFO ] Added : 26 causal constraints over 6 iterations in 158 ms. Result :sat
Could not prove EG p1
Support contains 36 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 28 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-09 02:44:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:27] [INFO ] Invariant cache hit.
[2023-03-09 02:44:27] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
[2023-03-09 02:44:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:27] [INFO ] Invariant cache hit.
[2023-03-09 02:44:28] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 02:44:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:28] [INFO ] Invariant cache hit.
[2023-03-09 02:44:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:28] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-09 02:44:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 02:44:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:28] [INFO ] Invariant cache hit.
[2023-03-09 02:44:28] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/63 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, (NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 435 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[p1, (NOT p0)]
[2023-03-09 02:44:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:29] [INFO ] Invariant cache hit.
[2023-03-09 02:44:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:29] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 02:44:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:44:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 02:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:44:30] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 02:44:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 302 ms returned sat
[2023-03-09 02:44:30] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 22 ms.
[2023-03-09 02:44:30] [INFO ] Added : 26 causal constraints over 6 iterations in 124 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 109 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 2012 reset in 291 ms.
Product exploration explored 100000 steps with 2042 reset in 288 ms.
Built C files in :
/tmp/ltsmin3414703751496793364
[2023-03-09 02:44:31] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2023-03-09 02:44:31] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:44:31] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2023-03-09 02:44:31] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:44:31] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2023-03-09 02:44:31] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:44:31] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3414703751496793364
Running compilation step : cd /tmp/ltsmin3414703751496793364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2213 ms.
Running link step : cd /tmp/ltsmin3414703751496793364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3414703751496793364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9058857380877029855.hoa' '--buchi-type=spotba'
LTSmin run took 6172 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-03 finished in 17086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 55 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-09 02:44:39] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2023-03-09 02:44:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:44:40] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2023-03-09 02:44:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:40] [INFO ] Invariant cache hit.
[2023-03-09 02:44:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 02:44:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-09 02:44:40] [INFO ] Invariant cache hit.
[2023-03-09 02:44:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/65 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 64/65 places, 548/548 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s19 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-06 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((!p0||X(X(p1))))) U (p0 U p2)))'
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 12 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:44:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:44:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 02:44:40] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2023-03-09 02:44:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:40] [INFO ] Invariant cache hit.
[2023-03-09 02:44:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 02:44:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:40] [INFO ] Invariant cache hit.
[2023-03-09 02:44:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:40] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-09 02:44:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:40] [INFO ] Invariant cache hit.
[2023-03-09 02:44:41] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/65 places, 547/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 64/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)), p0:(AND (GEQ s49 1) (GEQ s62 1)), p1:(AND (GEQ s49 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-08 finished in 1195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(p1)))||(G(p2) U p3))))'
Support contains 10 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 11 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:44:41] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:41] [INFO ] Invariant cache hit.
[2023-03-09 02:44:41] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
[2023-03-09 02:44:41] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:41] [INFO ] Invariant cache hit.
[2023-03-09 02:44:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 02:44:41] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:41] [INFO ] Invariant cache hit.
[2023-03-09 02:44:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:42] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-09 02:44:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:42] [INFO ] Invariant cache hit.
[2023-03-09 02:44:42] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/65 places, 547/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 64/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 953 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 14}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 15}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(AND p3 p2), acceptance={} source=5 dest: 1}, { cond=(NOT p2), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 10}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 12}, { cond=(AND p0 p3 p2), acceptance={} source=6 dest: 13}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 16}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 17}], [{ cond=(AND p3 p2), acceptance={0} source=7 dest: 2}, { cond=(NOT p2), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 3}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 7}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=10 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={0} source=11 dest: 12}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={0} source=11 dest: 13}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 16}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 17}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=13 dest: 16}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=13 dest: 17}], [{ cond=true, acceptance={} source=14 dest: 8}], [{ cond=(NOT p0), acceptance={} source=15 dest: 16}, { cond=p0, acceptance={} source=15 dest: 17}], [{ cond=(NOT p1), acceptance={} source=16 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=17 dest: 16}, { cond=(AND p0 (NOT p1)), acceptance={0} source=17 dest: 17}]], initial=4, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s49 1) (GEQ s63 1))), p3:(OR (AND (GEQ s2 1) (GEQ s26 1) (GEQ s27 1) (GEQ s58 1)) (A...], 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, 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-V20P10N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-09 finished in 1760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 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 64 transition count 547
Applied a total of 2 rules in 39 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:44:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:44:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:44:43] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
[2023-03-09 02:44:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:43] [INFO ] Invariant cache hit.
[2023-03-09 02:44:43] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 02:44:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:44:43] [INFO ] Invariant cache hit.
[2023-03-09 02:44:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:44] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 389 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/65 places, 547/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 672 ms. Remains : 63/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s48 1), p1:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4403 reset in 331 ms.
Stuttering criterion allowed to conclude after 12478 steps with 558 reset in 41 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-10 finished in 1245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 547
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 62 transition count 546
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 7 place count 61 transition count 545
Applied a total of 7 rules in 95 ms. Remains 61 /65 variables (removed 4) and now considering 545/548 (removed 3) transitions.
[2023-03-09 02:44:44] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 61 cols
[2023-03-09 02:44:44] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 02:44:44] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-09 02:44:44] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:44:44] [INFO ] Invariant cache hit.
[2023-03-09 02:44:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:45] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 391 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 545/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 60 /60 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 510 ms. Remains : 60/65 places, 545/548 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s45 1) (LT s51 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 1918 reset in 337 ms.
Product exploration explored 100000 steps with 1935 reset in 314 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 251 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 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 545/545 transitions.
Applied a total of 0 rules in 22 ms. Remains 60 /60 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2023-03-09 02:44:46] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2023-03-09 02:44:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 02:44:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 02:44:46] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:44:46] [INFO ] Invariant cache hit.
[2023-03-09 02:44:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:44:46] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-09 02:44:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:44:46] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:44:46] [INFO ] Invariant cache hit.
[2023-03-09 02:44:47] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 60/60 places, 545/545 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2038 reset in 210 ms.
Product exploration explored 100000 steps with 2011 reset in 205 ms.
Built C files in :
/tmp/ltsmin16426634936527018432
[2023-03-09 02:44:48] [INFO ] Computing symmetric may disable matrix : 545 transitions.
[2023-03-09 02:44:48] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:44:48] [INFO ] Computing symmetric may enable matrix : 545 transitions.
[2023-03-09 02:44:48] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:44:48] [INFO ] Computing Do-Not-Accords matrix : 545 transitions.
[2023-03-09 02:44:48] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:44:48] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16426634936527018432
Running compilation step : cd /tmp/ltsmin16426634936527018432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1417 ms.
Running link step : cd /tmp/ltsmin16426634936527018432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16426634936527018432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5630106958469542318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 545/545 transitions.
Applied a total of 0 rules in 15 ms. Remains 60 /60 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2023-03-09 02:45:03] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:45:03] [INFO ] Invariant cache hit.
[2023-03-09 02:45:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 02:45:03] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:45:03] [INFO ] Invariant cache hit.
[2023-03-09 02:45:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:45:03] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-09 02:45:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:45:03] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:45:03] [INFO ] Invariant cache hit.
[2023-03-09 02:45:03] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 60/60 places, 545/545 transitions.
Built C files in :
/tmp/ltsmin11354101621635683011
[2023-03-09 02:45:03] [INFO ] Computing symmetric may disable matrix : 545 transitions.
[2023-03-09 02:45:03] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:45:03] [INFO ] Computing symmetric may enable matrix : 545 transitions.
[2023-03-09 02:45:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:45:03] [INFO ] Computing Do-Not-Accords matrix : 545 transitions.
[2023-03-09 02:45:03] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:45:03] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11354101621635683011
Running compilation step : cd /tmp/ltsmin11354101621635683011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2257 ms.
Running link step : cd /tmp/ltsmin11354101621635683011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11354101621635683011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8373470723546974277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 02:45:18] [INFO ] Flatten gal took : 50 ms
[2023-03-09 02:45:18] [INFO ] Flatten gal took : 37 ms
[2023-03-09 02:45:18] [INFO ] Time to serialize gal into /tmp/LTL17344706645182595317.gal : 6 ms
[2023-03-09 02:45:18] [INFO ] Time to serialize properties into /tmp/LTL3516232517406087438.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17344706645182595317.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5453565330484157296.hoa' '-atoms' '/tmp/LTL3516232517406087438.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3516232517406087438.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5453565330484157296.hoa
Detected timeout of ITS tools.
[2023-03-09 02:45:34] [INFO ] Flatten gal took : 31 ms
[2023-03-09 02:45:34] [INFO ] Flatten gal took : 40 ms
[2023-03-09 02:45:34] [INFO ] Time to serialize gal into /tmp/LTL12259665941112844762.gal : 5 ms
[2023-03-09 02:45:34] [INFO ] Time to serialize properties into /tmp/LTL16108582571605641046.ltl : 8 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12259665941112844762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16108582571605641046.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((CHOIX_1<1)||(COMPTEUR_2<1))"))))
Formula 0 simplified : FG!"((CHOIX_1<1)||(COMPTEUR_2<1))"
Detected timeout of ITS tools.
[2023-03-09 02:45:49] [INFO ] Flatten gal took : 53 ms
[2023-03-09 02:45:49] [INFO ] Applying decomposition
[2023-03-09 02:45:49] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6017158908073954159.txt' '-o' '/tmp/graph6017158908073954159.bin' '-w' '/tmp/graph6017158908073954159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6017158908073954159.bin' '-l' '-1' '-v' '-w' '/tmp/graph6017158908073954159.weights' '-q' '0' '-e' '0.001'
[2023-03-09 02:45:49] [INFO ] Decomposing Gal with order
[2023-03-09 02:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 02:45:49] [INFO ] Removed a total of 905 redundant transitions.
[2023-03-09 02:45:49] [INFO ] Flatten gal took : 294 ms
[2023-03-09 02:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 12 ms.
[2023-03-09 02:45:49] [INFO ] Time to serialize gal into /tmp/LTL14335598863503291790.gal : 3 ms
[2023-03-09 02:45:49] [INFO ] Time to serialize properties into /tmp/LTL4780672930533087111.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14335598863503291790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4780672930533087111.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((u0.CHOIX_1<1)||(u2.COMPTEUR_2<1))"))))
Formula 0 simplified : FG!"((u0.CHOIX_1<1)||(u2.COMPTEUR_2<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8759999650574370363
[2023-03-09 02:46:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8759999650574370363
Running compilation step : cd /tmp/ltsmin8759999650574370363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 927 ms.
Running link step : cd /tmp/ltsmin8759999650574370363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8759999650574370363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-11 finished in 95474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 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 64 transition count 547
Applied a total of 2 rules in 25 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:46:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:46:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:46:20] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
[2023-03-09 02:46:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:20] [INFO ] Invariant cache hit.
[2023-03-09 02:46:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 02:46:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:20] [INFO ] Invariant cache hit.
[2023-03-09 02:46:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:20] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 290 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/65 places, 547/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 528 ms. Remains : 63/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-12 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 (GEQ s46 1) (GEQ s62 1) (OR (LT s48 1) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s31 1) (GEQ s53 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 1438 reset in 295 ms.
Product exploration explored 100000 steps with 1436 reset in 237 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 219 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 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 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 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
[2023-03-09 02:46:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-09 02:46:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:46:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:21] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-09 02:46:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:46:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:22] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 02:46:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 146 ms returned sat
[2023-03-09 02:46:22] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 23 ms.
[2023-03-09 02:46:22] [INFO ] Added : 10 causal constraints over 3 iterations in 154 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 33 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-09 02:46:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:22] [INFO ] Invariant cache hit.
[2023-03-09 02:46:22] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
[2023-03-09 02:46:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:22] [INFO ] Invariant cache hit.
[2023-03-09 02:46:22] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 02:46:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:22] [INFO ] Invariant cache hit.
[2023-03-09 02:46:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-09 02:46:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 02:46:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:23] [INFO ] Invariant cache hit.
[2023-03-09 02:46:23] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 835 ms. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT 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 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2023-03-09 02:46:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:23] [INFO ] Invariant cache hit.
[2023-03-09 02:46:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:23] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-09 02:46:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:46:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:23] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-09 02:46:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 143 ms returned sat
[2023-03-09 02:46:24] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 30 ms.
[2023-03-09 02:46:24] [INFO ] Added : 10 causal constraints over 3 iterations in 93 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1435 reset in 252 ms.
Product exploration explored 100000 steps with 1451 reset in 271 ms.
Built C files in :
/tmp/ltsmin4883051235758871815
[2023-03-09 02:46:24] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2023-03-09 02:46:24] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:46:24] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2023-03-09 02:46:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:46:24] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2023-03-09 02:46:24] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:46:24] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4883051235758871815
Running compilation step : cd /tmp/ltsmin4883051235758871815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1623 ms.
Running link step : cd /tmp/ltsmin4883051235758871815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4883051235758871815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7406585304141168159.hoa' '--buchi-type=spotba'
LTSmin run took 3738 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-12 finished in 10293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:46:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:46:30] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-09 02:46:30] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
[2023-03-09 02:46:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:30] [INFO ] Invariant cache hit.
[2023-03-09 02:46:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 02:46:30] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:30] [INFO ] Invariant cache hit.
[2023-03-09 02:46:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:30] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 314 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 547/548 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 547 ms. Remains : 63/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s47 1) (GEQ s62 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 1281 reset in 205 ms.
Product exploration explored 100000 steps with 1281 reset in 277 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-09 02:46:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:46:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-09 02:46:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:46:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:32] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-09 02:46:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2023-03-09 02:46:32] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 30 ms.
[2023-03-09 02:46:32] [INFO ] Added : 21 causal constraints over 7 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 02:46:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:32] [INFO ] Invariant cache hit.
[2023-03-09 02:46:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:33] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-09 02:46:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:33] [INFO ] Invariant cache hit.
[2023-03-09 02:46:33] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 02:46:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:33] [INFO ] Invariant cache hit.
[2023-03-09 02:46:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:34] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-09 02:46:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:46:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 02:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:46:34] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-09 02:46:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-09 02:46:34] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 15 ms.
[2023-03-09 02:46:34] [INFO ] Added : 21 causal constraints over 8 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1281 reset in 201 ms.
Product exploration explored 100000 steps with 1272 reset in 341 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 547
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 44 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-09 02:46:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
[2023-03-09 02:46:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 02:46:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:35] [INFO ] Invariant cache hit.
[2023-03-09 02:46:35] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/63 places, 547/547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 63/63 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin2640405802013316542
[2023-03-09 02:46:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2640405802013316542
Running compilation step : cd /tmp/ltsmin2640405802013316542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 917 ms.
Running link step : cd /tmp/ltsmin2640405802013316542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2640405802013316542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4357378623133339041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-09 02:46:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-09 02:46:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:46:51] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
[2023-03-09 02:46:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:51] [INFO ] Invariant cache hit.
[2023-03-09 02:46:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 02:46:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:51] [INFO ] Invariant cache hit.
[2023-03-09 02:46:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:46:51] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-09 02:46:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:46:51] [INFO ] Invariant cache hit.
[2023-03-09 02:46:51] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 63/63 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin9052248782899174004
[2023-03-09 02:46:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9052248782899174004
Running compilation step : cd /tmp/ltsmin9052248782899174004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 817 ms.
Running link step : cd /tmp/ltsmin9052248782899174004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin9052248782899174004;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15020888582569860522.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 02:47:06] [INFO ] Flatten gal took : 19 ms
[2023-03-09 02:47:06] [INFO ] Flatten gal took : 26 ms
[2023-03-09 02:47:06] [INFO ] Time to serialize gal into /tmp/LTL12071807860951718662.gal : 4 ms
[2023-03-09 02:47:06] [INFO ] Time to serialize properties into /tmp/LTL5993609547001569062.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12071807860951718662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11191655421055282751.hoa' '-atoms' '/tmp/LTL5993609547001569062.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5993609547001569062.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11191655421055282751.hoa
Detected timeout of ITS tools.
[2023-03-09 02:47:21] [INFO ] Flatten gal took : 34 ms
[2023-03-09 02:47:21] [INFO ] Flatten gal took : 37 ms
[2023-03-09 02:47:21] [INFO ] Time to serialize gal into /tmp/LTL3845236529884191153.gal : 19 ms
[2023-03-09 02:47:21] [INFO ] Time to serialize properties into /tmp/LTL11790808030964566712.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3845236529884191153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11790808030964566712.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((CHOIX_1>=1)&&(COMPTEUR_10>=1))")))))
Formula 0 simplified : XXG!"((CHOIX_1>=1)&&(COMPTEUR_10>=1))"
Detected timeout of ITS tools.
[2023-03-09 02:47:36] [INFO ] Flatten gal took : 33 ms
[2023-03-09 02:47:36] [INFO ] Applying decomposition
[2023-03-09 02:47:36] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5634970992520778847.txt' '-o' '/tmp/graph5634970992520778847.bin' '-w' '/tmp/graph5634970992520778847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5634970992520778847.bin' '-l' '-1' '-v' '-w' '/tmp/graph5634970992520778847.weights' '-q' '0' '-e' '0.001'
[2023-03-09 02:47:37] [INFO ] Decomposing Gal with order
[2023-03-09 02:47:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 02:47:37] [INFO ] Removed a total of 965 redundant transitions.
[2023-03-09 02:47:37] [INFO ] Flatten gal took : 134 ms
[2023-03-09 02:47:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 8 ms.
[2023-03-09 02:47:37] [INFO ] Time to serialize gal into /tmp/LTL17450553789652181490.gal : 2 ms
[2023-03-09 02:47:37] [INFO ] Time to serialize properties into /tmp/LTL3062203623205702255.ltl : 25 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17450553789652181490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3062203623205702255.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((u1.CHOIX_1>=1)&&(i0.u0.COMPTEUR_10>=1))")))))
Formula 0 simplified : XXG!"((u1.CHOIX_1>=1)&&(i0.u0.COMPTEUR_10>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8024241472236946124
[2023-03-09 02:47:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8024241472236946124
Running compilation step : cd /tmp/ltsmin8024241472236946124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 887 ms.
Running link step : cd /tmp/ltsmin8024241472236946124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8024241472236946124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 10392 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-13 finished in 93392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 547
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2023-03-09 02:48:03] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-09 02:48:03] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:48:04] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
[2023-03-09 02:48:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:48:04] [INFO ] Invariant cache hit.
[2023-03-09 02:48:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 02:48:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-09 02:48:04] [INFO ] Invariant cache hit.
[2023-03-09 02:48:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:48:04] [INFO ] Implicit Places using invariants and state equation in 419 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 528 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 547/548 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 952 ms. Remains : 63/65 places, 547/548 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-15 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 s48 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1065 reset in 213 ms.
Product exploration explored 100000 steps with 1072 reset in 199 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 105 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-09 02:48:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-09 02:48:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:48:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:48:05] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-09 02:48:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:48:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 02:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:48:06] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-09 02:48:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:48:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2023-03-09 02:48:06] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 14 ms.
[2023-03-09 02:48:06] [INFO ] Added : 27 causal constraints over 6 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 546
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 5 place count 60 transition count 545
Applied a total of 5 rules in 28 ms. Remains 60 /63 variables (removed 3) and now considering 545/547 (removed 2) transitions.
[2023-03-09 02:48:06] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2023-03-09 02:48:06] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 02:48:06] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-09 02:48:06] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:48:06] [INFO ] Invariant cache hit.
[2023-03-09 02:48:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:48:07] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2023-03-09 02:48:07] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 02:48:07] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:48:07] [INFO ] Invariant cache hit.
[2023-03-09 02:48:07] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 545/547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1221 ms. Remains : 60/63 places, 545/547 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
[2023-03-09 02:48:07] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
[2023-03-09 02:48:07] [INFO ] Invariant cache hit.
[2023-03-09 02:48:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 02:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:48:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 02:48:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:48:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-09 02:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:48:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-09 02:48:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 02:48:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 265 ms returned sat
[2023-03-09 02:48:08] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 74 transitions) in 21 ms.
[2023-03-09 02:48:08] [INFO ] Added : 10 causal constraints over 2 iterations in 131 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1286 reset in 210 ms.
Product exploration explored 100000 steps with 1288 reset in 186 ms.
Built C files in :
/tmp/ltsmin4790158060704889974
[2023-03-09 02:48:08] [INFO ] Computing symmetric may disable matrix : 545 transitions.
[2023-03-09 02:48:08] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:48:08] [INFO ] Computing symmetric may enable matrix : 545 transitions.
[2023-03-09 02:48:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:48:09] [INFO ] Computing Do-Not-Accords matrix : 545 transitions.
[2023-03-09 02:48:09] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:48:09] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4790158060704889974
Running compilation step : cd /tmp/ltsmin4790158060704889974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1399 ms.
Running link step : cd /tmp/ltsmin4790158060704889974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4790158060704889974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3559210948943344769.hoa' '--buchi-type=spotba'
LTSmin run took 3296 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-15 finished in 10026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-09 02:48:13] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5516706002419557352
[2023-03-09 02:48:13] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2023-03-09 02:48:13] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:48:13] [INFO ] Applying decomposition
[2023-03-09 02:48:13] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2023-03-09 02:48:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 02:48:13] [INFO ] Flatten gal took : 27 ms
[2023-03-09 02:48:14] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2023-03-09 02:48:14] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13828742443561644999.txt' '-o' '/tmp/graph13828742443561644999.bin' '-w' '/tmp/graph13828742443561644999.weights'
[2023-03-09 02:48:14] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5516706002419557352
Running compilation step : cd /tmp/ltsmin5516706002419557352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13828742443561644999.bin' '-l' '-1' '-v' '-w' '/tmp/graph13828742443561644999.weights' '-q' '0' '-e' '0.001'
[2023-03-09 02:48:14] [INFO ] Decomposing Gal with order
[2023-03-09 02:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 02:48:14] [INFO ] Removed a total of 992 redundant transitions.
[2023-03-09 02:48:14] [INFO ] Flatten gal took : 187 ms
[2023-03-09 02:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 18 ms.
[2023-03-09 02:48:14] [INFO ] Time to serialize gal into /tmp/LTLFireability4449132554658594915.gal : 1 ms
[2023-03-09 02:48:14] [INFO ] Time to serialize properties into /tmp/LTLFireability18140778584715069557.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4449132554658594915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18140778584715069557.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((u1.CHOIX_1<1)||(i2.u4.COMPTEUR_2<1))"))))
Formula 0 simplified : FG!"((u1.CHOIX_1<1)||(i2.u4.COMPTEUR_2<1))"
Compilation finished in 1508 ms.
Running link step : cd /tmp/ltsmin5516706002419557352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5516706002419557352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 252624 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 507264 ms.

BK_STOP 1678330348480

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P10N10, 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 r037-tajo-167813690000180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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