Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716622653163

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-25 07:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 07:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 07:37:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 07:37:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 07:37:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2024-05-25 07:37:35] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 07:37:35] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2024-05-25 07:37:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2024-05-25 07:37:36] [INFO ] Computed 4 invariants in 4 ms
[2024-05-25 07:37:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-25 07:37:36] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-25 07:37:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-25 07:37:36] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-25 07:37:36] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 07:37:36] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (complete) has 20 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 6 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 6 transition count 4
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 12 place count 5 transition count 4
Applied a total of 12 rules in 17 ms. Remains 5 /12 variables (removed 7) and now considering 4/10 (removed 6) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-25 07:37:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 07:37:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 5/12 places, 4/10 transitions.
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 07:37:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-25 07:37:36] [INFO ] Flatten gal took : 25 ms
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 07:37:37] [INFO ] Flatten gal took : 3 ms
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-25 07:37:37] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 25 ms.
[2024-05-25 07:37:37] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 12 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:37:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-05-25 07:37:37] [INFO ] Computed 7 invariants in 5 ms
[2024-05-25 07:37:37] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2024-05-25 07:37:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:37] [INFO ] Invariant cache hit.
[2024-05-25 07:37:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 07:37:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:37] [INFO ] Invariant cache hit.
[2024-05-25 07:37:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:37] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-25 07:37:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:37] [INFO ] Invariant cache hit.
[2024-05-25 07:37:37] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 48/48 places, 288/288 transitions.
Support contains 12 out of 48 places after structural reductions.
[2024-05-25 07:37:37] [INFO ] Flatten gal took : 24 ms
[2024-05-25 07:37:37] [INFO ] Flatten gal took : 21 ms
[2024-05-25 07:37:37] [INFO ] Input system was already deterministic with 288 transitions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 19) seen :18
Finished Best-First random walk after 145 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=145 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 44 stable transitions
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(!p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 287
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 6 place count 43 transition count 286
Applied a total of 6 rules in 35 ms. Remains 43 /48 variables (removed 5) and now considering 286/288 (removed 2) transitions.
[2024-05-25 07:37:38] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
// Phase 1: matrix 88 rows 43 cols
[2024-05-25 07:37:38] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 07:37:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 07:37:38] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
[2024-05-25 07:37:38] [INFO ] Invariant cache hit.
[2024-05-25 07:37:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 219 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 286/288 transitions.
Applied a total of 0 rules in 20 ms. Remains 41 /41 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 41/48 places, 286/288 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 267 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s26 s27))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7822 reset in 273 ms.
Product exploration explored 100000 steps with 7791 reset in 244 ms.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[false, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[false, (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 286/286 transitions.
Applied a total of 0 rules in 12 ms. Remains 41 /41 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-05-25 07:37:39] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
// Phase 1: matrix 88 rows 41 cols
[2024-05-25 07:37:39] [INFO ] Computed 4 invariants in 3 ms
[2024-05-25 07:37:39] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 07:37:39] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
[2024-05-25 07:37:39] [INFO ] Invariant cache hit.
[2024-05-25 07:37:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:40] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-25 07:37:40] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-25 07:37:40] [INFO ] Flow matrix only has 88 transitions (discarded 198 similar events)
[2024-05-25 07:37:40] [INFO ] Invariant cache hit.
[2024-05-25 07:37:40] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 41/41 places, 286/286 transitions.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[false, (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[false, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7811 reset in 185 ms.
Product exploration explored 100000 steps with 7796 reset in 190 ms.
Built C files in :
/tmp/ltsmin7787918672544088159
[2024-05-25 07:37:41] [INFO ] Computing symmetric may disable matrix : 286 transitions.
[2024-05-25 07:37:41] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:41] [INFO ] Computing symmetric may enable matrix : 286 transitions.
[2024-05-25 07:37:41] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:41] [INFO ] Computing Do-Not-Accords matrix : 286 transitions.
[2024-05-25 07:37:41] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:41] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7787918672544088159
Running compilation step : cd /tmp/ltsmin7787918672544088159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 878 ms.
Running link step : cd /tmp/ltsmin7787918672544088159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin7787918672544088159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15055606286950810272.hoa' '--buchi-type=spotba'
LTSmin run took 11328 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 finished in 15857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G((p1&&X(p2)))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 4 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:37:53] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2024-05-25 07:37:54] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 07:37:54] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:54] [INFO ] Invariant cache hit.
[2024-05-25 07:37:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:54] [INFO ] Invariant cache hit.
[2024-05-25 07:37:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:54] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 185 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 409 ms. Remains : 46/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s28), p0:(LEQ 2 s13), p2:(LEQ 2 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:54] [INFO ] Invariant cache hit.
[2024-05-25 07:37:54] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:54] [INFO ] Invariant cache hit.
[2024-05-25 07:37:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:54] [INFO ] Invariant cache hit.
[2024-05-25 07:37:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:55] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 233 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Applied a total of 0 rules in 27 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 427 ms. Remains : 46/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s13 s28), p0:(GT 1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 5 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 07:37:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:37:55] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:55] [INFO ] Invariant cache hit.
[2024-05-25 07:37:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:55] [INFO ] Invariant cache hit.
[2024-05-25 07:37:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 247 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 452 ms. Remains : 44/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 101 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&(G(p2)||X(p3))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 12 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2024-05-25 07:37:55] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 07:37:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:55] [INFO ] Invariant cache hit.
[2024-05-25 07:37:56] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:37:56] [INFO ] Invariant cache hit.
[2024-05-25 07:37:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:37:56] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 435 ms. Remains : 46/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND p1 p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ s12 s13) (LEQ s14 s27)), p1:(LEQ 2 s27), p2:(LEQ 2 s26), p3:(LEQ s14 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12309 reset in 349 ms.
Product exploration explored 100000 steps with 12220 reset in 314 ms.
Computed a total of 29 stabilizing places and 44 stable transitions
Graph (complete) has 645 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 44 stable transitions
Detected a total of 29/46 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 53 factoid took 38216 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 07:38:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 07:38:37] [INFO ] Computed 5 invariants in 5 ms
[2024-05-25 07:38:37] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 07:38:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:38:37] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 07:38:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:38:37] [INFO ] After 63ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 07:38:37] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-25 07:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-25 07:38:37] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-25 07:38:37] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 14 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:38:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:38:38] [INFO ] Invariant cache hit.
[2024-05-25 07:38:38] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 46/46 places, 288/288 transitions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 294368 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294368 steps, saw 73493 distinct states, run finished after 3003 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-25 07:38:42] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:38:42] [INFO ] Invariant cache hit.
[2024-05-25 07:38:42] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 07:38:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:38:42] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 07:38:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:38:42] [INFO ] After 62ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 07:38:42] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-25 07:38:42] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 46/46 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:38:42] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:38:42] [INFO ] Invariant cache hit.
[2024-05-25 07:38:42] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-25 07:38:42] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:38:42] [INFO ] Invariant cache hit.
[2024-05-25 07:38:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:38:42] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-25 07:38:42] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 07:38:42] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:38:42] [INFO ] Invariant cache hit.
[2024-05-25 07:38:42] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 46/46 places, 288/288 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 46 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 44 transition count 88
Applied a total of 202 rules in 4 ms. Remains 44 /46 variables (removed 2) and now considering 88/288 (removed 200) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 88 rows 44 cols
[2024-05-25 07:38:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:38:42] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 07:38:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:38:42] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 07:38:43] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-25 07:38:43] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 p1 p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 53 factoid took 65655 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 444 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:39:49] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 07:39:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:39:50] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
[2024-05-25 07:39:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:39:50] [INFO ] Invariant cache hit.
[2024-05-25 07:39:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-25 07:39:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:39:50] [INFO ] Invariant cache hit.
[2024-05-25 07:39:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:39:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-25 07:39:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:39:50] [INFO ] Invariant cache hit.
[2024-05-25 07:39:50] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 730 ms. Remains : 46/46 places, 288/288 transitions.
Computed a total of 29 stabilizing places and 44 stable transitions
Graph (complete) has 645 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 44 stable transitions
Detected a total of 29/46 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 53 factoid took 34699 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 07:40:26] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:40:26] [INFO ] Invariant cache hit.
[2024-05-25 07:40:26] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 07:40:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:40:26] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 07:40:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:40:26] [INFO ] After 60ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 07:40:26] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-25 07:40:27] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:40:27] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:40:27] [INFO ] Invariant cache hit.
[2024-05-25 07:40:27] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 46/46 places, 288/288 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 350765 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 350765 steps, saw 86907 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-25 07:40:30] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:40:30] [INFO ] Invariant cache hit.
[2024-05-25 07:40:30] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 07:40:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 07:40:30] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 07:40:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:40:31] [INFO ] After 66ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 07:40:31] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-25 07:40:31] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 46/46 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:40:31] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:40:31] [INFO ] Invariant cache hit.
[2024-05-25 07:40:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-25 07:40:31] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:40:31] [INFO ] Invariant cache hit.
[2024-05-25 07:40:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:40:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-25 07:40:31] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 07:40:31] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:40:31] [INFO ] Invariant cache hit.
[2024-05-25 07:40:31] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 46/46 places, 288/288 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 46 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 44 transition count 88
Applied a total of 202 rules in 5 ms. Remains 44 /46 variables (removed 2) and now considering 88/288 (removed 200) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 88 rows 44 cols
[2024-05-25 07:40:31] [INFO ] Computed 5 invariants in 13 ms
[2024-05-25 07:40:31] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 07:40:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 07:40:31] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 07:40:31] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-25 07:40:31] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 p1 p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 53 factoid took 65439 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 385 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 457 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 12235 reset in 319 ms.
Product exploration explored 100000 steps with 12223 reset in 325 ms.
Built C files in :
/tmp/ltsmin12466485699980868573
[2024-05-25 07:41:39] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12466485699980868573
Running compilation step : cd /tmp/ltsmin12466485699980868573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin12466485699980868573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12466485699980868573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5544202085509477330.hoa' '--buchi-type=spotba'
LTSmin run took 160 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 finished in 224544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F((p1 U (p2||G(p1))))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:41:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2024-05-25 07:41:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 07:41:40] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
[2024-05-25 07:41:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:41:40] [INFO ] Invariant cache hit.
[2024-05-25 07:41:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-25 07:41:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:41:40] [INFO ] Invariant cache hit.
[2024-05-25 07:41:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:41:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 225 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 45/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s43 s44) s0), p2:(AND (NOT (AND (LEQ s0 s12) (LEQ 3 (ADD s43 s44)))) (LEQ s0 s12)), p1:(LEQ s0 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 5 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2024-05-25 07:41:40] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-05-25 07:41:40] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 07:41:41] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
[2024-05-25 07:41:41] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:41:41] [INFO ] Invariant cache hit.
[2024-05-25 07:41:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-25 07:41:41] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:41:41] [INFO ] Invariant cache hit.
[2024-05-25 07:41:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:41:41] [INFO ] Implicit Places using invariants and state equation in 159 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 250 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 287/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 44/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 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:(LEQ s25 (ADD s29 s30))], 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 4574 reset in 231 ms.
Product exploration explored 100000 steps with 4850 reset in 195 ms.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 132 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 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 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 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-05-25 07:41:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2024-05-25 07:41:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:41:42] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
[2024-05-25 07:41:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:41:42] [INFO ] Invariant cache hit.
[2024-05-25 07:41:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-25 07:41:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:41:42] [INFO ] Invariant cache hit.
[2024-05-25 07:41:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:41:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-25 07:41:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:41:42] [INFO ] Invariant cache hit.
[2024-05-25 07:41:42] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 44/44 places, 287/287 transitions.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 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 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 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 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4874 reset in 281 ms.
Product exploration explored 100000 steps with 4861 reset in 261 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 287
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 16 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-05-25 07:41:44] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2024-05-25 07:41:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:41:44] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
[2024-05-25 07:41:44] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 07:41:44] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:41:44] [INFO ] Invariant cache hit.
[2024-05-25 07:41:44] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/44 places, 287/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 44/44 places, 287/287 transitions.
Built C files in :
/tmp/ltsmin11518216554394310540
[2024-05-25 07:41:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11518216554394310540
Running compilation step : cd /tmp/ltsmin11518216554394310540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 710 ms.
Running link step : cd /tmp/ltsmin11518216554394310540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11518216554394310540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13236379051838505875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-05-25 07:41:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2024-05-25 07:41:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:42:00] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
[2024-05-25 07:42:00] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:42:00] [INFO ] Invariant cache hit.
[2024-05-25 07:42:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-25 07:42:00] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:42:00] [INFO ] Invariant cache hit.
[2024-05-25 07:42:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-25 07:42:00] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2024-05-25 07:42:00] [INFO ] Invariant cache hit.
[2024-05-25 07:42:00] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 44/44 places, 287/287 transitions.
Built C files in :
/tmp/ltsmin11339675138732203993
[2024-05-25 07:42:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11339675138732203993
Running compilation step : cd /tmp/ltsmin11339675138732203993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin11339675138732203993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11339675138732203993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11378780431015666326.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 07:42:15] [INFO ] Flatten gal took : 24 ms
[2024-05-25 07:42:15] [INFO ] Flatten gal took : 18 ms
[2024-05-25 07:42:15] [INFO ] Time to serialize gal into /tmp/LTL15122132527993518327.gal : 5 ms
[2024-05-25 07:42:15] [INFO ] Time to serialize properties into /tmp/LTL15013125351401986213.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15122132527993518327.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3736055803022940795.hoa' '-atoms' '/tmp/LTL15013125351401986213.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15013125351401986213.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3736055803022940795.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t22, t23, t25, t56, t57, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t70, t71,...1299
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
530 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.37954,165428,1,0,1098,444007,568,489,4523,374696,1315
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 finished in 40457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1||X(p2))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:42:21] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-05-25 07:42:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 07:42:21] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
[2024-05-25 07:42:21] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:21] [INFO ] Invariant cache hit.
[2024-05-25 07:42:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-25 07:42:21] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:21] [INFO ] Invariant cache hit.
[2024-05-25 07:42:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:21] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 235 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 46/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s14 s12), p1:(LEQ 2 s28), p2:(LEQ 1 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G((p1 U X(p2))))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:42:21] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2024-05-25 07:42:21] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 07:42:22] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
[2024-05-25 07:42:22] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:22] [INFO ] Invariant cache hit.
[2024-05-25 07:42:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-25 07:42:22] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:22] [INFO ] Invariant cache hit.
[2024-05-25 07:42:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:22] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 46/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GT s12 1), p1:(AND (LEQ 2 s27) (LEQ 1 s12)), p2:(LEQ 1 s12)], nbAcceptance=2, 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 3162 reset in 275 ms.
Product exploration explored 100000 steps with 3211 reset in 323 ms.
Computed a total of 29 stabilizing places and 44 stable transitions
Graph (complete) has 645 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 44 stable transitions
Detected a total of 29/46 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 4089 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 07:42:27] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2024-05-25 07:42:27] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 07:42:27] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 30 factoid took 15368 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-25 07:42:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:43] [INFO ] Invariant cache hit.
[2024-05-25 07:42:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-25 07:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:42:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 07:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:43] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-25 07:42:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 391 ms returned sat
[2024-05-25 07:42:44] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-25 07:42:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-25 07:42:44] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 28 ms.
[2024-05-25 07:42:44] [INFO ] Added : 10 causal constraints over 5 iterations in 107 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 07:42:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:44] [INFO ] Invariant cache hit.
[2024-05-25 07:42:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 07:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:44] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-25 07:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:42:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 07:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-25 07:42:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2024-05-25 07:42:45] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-25 07:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-25 07:42:45] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 15 ms.
[2024-05-25 07:42:45] [INFO ] Added : 10 causal constraints over 5 iterations in 51 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-05-25 07:42:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:45] [INFO ] Invariant cache hit.
[2024-05-25 07:42:45] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
[2024-05-25 07:42:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:45] [INFO ] Invariant cache hit.
[2024-05-25 07:42:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 07:42:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:45] [INFO ] Invariant cache hit.
[2024-05-25 07:42:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-25 07:42:45] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:45] [INFO ] Invariant cache hit.
[2024-05-25 07:42:45] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 46/46 places, 288/288 transitions.
Computed a total of 29 stabilizing places and 44 stable transitions
Graph (complete) has 645 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 44 stable transitions
Detected a total of 29/46 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1100 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 79 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (AND (NOT p0) p1)), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 16 factoid took 3122 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-25 07:42:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:50] [INFO ] Invariant cache hit.
[2024-05-25 07:42:50] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 07:42:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:42:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-25 07:42:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 335 ms returned sat
[2024-05-25 07:42:51] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-25 07:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-25 07:42:51] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 28 ms.
[2024-05-25 07:42:51] [INFO ] Added : 10 causal constraints over 5 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 07:42:51] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2024-05-25 07:42:51] [INFO ] Invariant cache hit.
[2024-05-25 07:42:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 07:42:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:42:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 07:42:51] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-25 07:42:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 07:42:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2024-05-25 07:42:51] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-25 07:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-25 07:42:51] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 14 ms.
[2024-05-25 07:42:51] [INFO ] Added : 10 causal constraints over 5 iterations in 42 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3131 reset in 251 ms.
Product exploration explored 100000 steps with 3196 reset in 262 ms.
Built C files in :
/tmp/ltsmin13726481156632730971
[2024-05-25 07:42:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13726481156632730971
Running compilation step : cd /tmp/ltsmin13726481156632730971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin13726481156632730971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13726481156632730971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12258944009229607460.hoa' '--buchi-type=spotba'
LTSmin run took 9792 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 finished in 40914 ms.
All properties solved by simple procedures.
Total runtime 327747 ms.

BK_STOP 1716622983066

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-COL-V10P10N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BridgeAndVehicles-COL-V10P10N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414200007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;