Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918000027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918000027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.3K Apr 29 21:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 21:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 21:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 21:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 40K May 10 09:33 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-V20P10N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652537801603

Running Version 202205111006
[2022-05-14 14:16:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 14:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:16:42] [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.
[2022-05-14 14:16:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:16:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2022-05-14 14:16:43] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 14:16:43] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 9 ms.
[2022-05-14 14:16:43] [INFO ] Skeletonized 13 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-09 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.1 ms
Remains 11 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-V20P10N20-LTLCardinality-06 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.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:16:44] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-14 14:16:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 14:16:44] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-14 14:16:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 14:16:44] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-14 14:16:44] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-14 14:16:44] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 14:16:44] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-14 14:16:44] [INFO ] Flatten gal took : 14 ms
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 14:16:44] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 14:16:44] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 64 ms.
[2022-05-14 14:16:44] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 12 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 41 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-14 14:16:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-14 14:16:44] [INFO ] Computed 7 place invariants in 10 ms
[2022-05-14 14:16:45] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
[2022-05-14 14:16:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-14 14:16:45] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-14 14:16:45] [INFO ] Implicit Places using invariants in 201 ms returned []
[2022-05-14 14:16:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-14 14:16:45] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-14 14:16:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:46] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2022-05-14 14:16:46] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-14 14:16:46] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-14 14:16:46] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 968/968 transitions.
Support contains 12 out of 78 places after structural reductions.
[2022-05-14 14:16:46] [INFO ] Flatten gal took : 79 ms
[2022-05-14 14:16:46] [INFO ] Flatten gal took : 78 ms
[2022-05-14 14:16:46] [INFO ] Input system was already deterministic with 968 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 14:16:46] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-14 14:16:46] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-14 14:16:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 14:16:46] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1690 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(X(G(p1)))||F(p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Applied a total of 2 rules in 14 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
[2022-05-14 14:16:47] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:16:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:47] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
[2022-05-14 14:16:47] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:16:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-14 14:16:47] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:16:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:48] [INFO ] Implicit Places using invariants and state equation in 517 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 675 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/78 places, 968/968 transitions.
Applied a total of 0 rules in 16 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/78 places, 968/968 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ s24 (ADD s48 s49)), p0:(LEQ 1 (ADD s73 s74)), p1:(LEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-01 finished in 1415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 967
Applied a total of 3 rules in 122 ms. Remains 76 /78 variables (removed 2) and now considering 967/968 (removed 1) transitions.
[2022-05-14 14:16:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 76 cols
[2022-05-14 14:16:48] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 14:16:48] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
[2022-05-14 14:16:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 76 cols
[2022-05-14 14:16:48] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 14:16:49] [INFO ] Implicit Places using invariants in 163 ms returned []
[2022-05-14 14:16:49] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 76 cols
[2022-05-14 14:16:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 14:16:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:49] [INFO ] Implicit Places using invariants and state equation in 385 ms returned [24, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 562 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/78 places, 967/968 transitions.
Applied a total of 0 rules in 51 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s24 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4974 reset in 491 ms.
Product exploration explored 100000 steps with 4672 reset in 383 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1599 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/74 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 258 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2022-05-14 14:16:51] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:51] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:16:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:16:51] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-14 14:16:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:16:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:16:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-14 14:16:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 120 ms returned sat
[2022-05-14 14:16:51] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 55 ms.
[2022-05-14 14:16:51] [INFO ] Added : 21 causal constraints over 5 iterations in 141 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 967/967 transitions.
Applied a total of 0 rules in 59 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-14 14:16:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:52] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
[2022-05-14 14:16:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:52] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-14 14:16:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:52] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2022-05-14 14:16:52] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-14 14:16:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:53] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 967/967 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1599 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/74 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2022-05-14 14:16:53] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:16:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:16:53] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-14 14:16:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:16:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:16:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:16:54] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-14 14:16:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:54] [INFO ] [Nat]Added 42 Read/Feed constraints in 115 ms returned sat
[2022-05-14 14:16:54] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 37 ms.
[2022-05-14 14:16:54] [INFO ] Added : 21 causal constraints over 5 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4833 reset in 367 ms.
Product exploration explored 100000 steps with 4796 reset in 354 ms.
Built C files in :
/tmp/ltsmin10539726852554577239
[2022-05-14 14:16:55] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-14 14:16:55] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:16:55] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-14 14:16:55] [INFO ] Computation of Complete enable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:16:55] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-14 14:16:55] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:16:55] [INFO ] Built C files in 458ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10539726852554577239
Running compilation step : cd /tmp/ltsmin10539726852554577239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10539726852554577239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10539726852554577239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 967/967 transitions.
Applied a total of 0 rules in 49 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-14 14:16:58] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:59] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
[2022-05-14 14:16:59] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:59] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-14 14:16:59] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:16:59] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2022-05-14 14:16:59] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-14 14:16:59] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-14 14:16:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:16:59] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin12279329713446124510
[2022-05-14 14:16:59] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-14 14:16:59] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:16:59] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-14 14:16:59] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:00] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-14 14:17:00] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:00] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12279329713446124510
Running compilation step : cd /tmp/ltsmin12279329713446124510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12279329713446124510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12279329713446124510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 14:17:03] [INFO ] Flatten gal took : 51 ms
[2022-05-14 14:17:03] [INFO ] Flatten gal took : 50 ms
[2022-05-14 14:17:03] [INFO ] Time to serialize gal into /tmp/LTL3912978705558067616.gal : 8 ms
[2022-05-14 14:17:03] [INFO ] Time to serialize properties into /tmp/LTL9287897513129219928.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3912978705558067616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9287897513129219928.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3912978...266
Read 1 LTL properties
Checking formula 0 : !((F("(SUR_PONT_A_0>SORTI_A_0)")))
Formula 0 simplified : !F"(SUR_PONT_A_0>SORTI_A_0)"
Detected timeout of ITS tools.
[2022-05-14 14:17:18] [INFO ] Flatten gal took : 77 ms
[2022-05-14 14:17:18] [INFO ] Applying decomposition
[2022-05-14 14:17:18] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11252579065739999885.txt' '-o' '/tmp/graph11252579065739999885.bin' '-w' '/tmp/graph11252579065739999885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11252579065739999885.bin' '-l' '-1' '-v' '-w' '/tmp/graph11252579065739999885.weights' '-q' '0' '-e' '0.001'
[2022-05-14 14:17:18] [INFO ] Decomposing Gal with order
[2022-05-14 14:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:17:19] [INFO ] Removed a total of 874 redundant transitions.
[2022-05-14 14:17:19] [INFO ] Flatten gal took : 352 ms
[2022-05-14 14:17:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 10 ms.
[2022-05-14 14:17:19] [INFO ] Time to serialize gal into /tmp/LTL6025581126982353189.gal : 4 ms
[2022-05-14 14:17:19] [INFO ] Time to serialize properties into /tmp/LTL15490258895258003754.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6025581126982353189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15490258895258003754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6025581...267
Read 1 LTL properties
Checking formula 0 : !((F("(gu0.SUR_PONT_A_0>gu0.SORTI_A_0)")))
Formula 0 simplified : !F"(gu0.SUR_PONT_A_0>gu0.SORTI_A_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1676339717151038197
[2022-05-14 14:17:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1676339717151038197
Running compilation step : cd /tmp/ltsmin1676339717151038197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1763 ms.
Running link step : cd /tmp/ltsmin1676339717151038197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1676339717151038197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 2946 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02 finished in 50802 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 967
Applied a total of 3 rules in 78 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
[2022-05-14 14:17:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-14 14:17:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:40] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
[2022-05-14 14:17:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-14 14:17:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:40] [INFO ] Implicit Places using invariants in 142 ms returned []
[2022-05-14 14:17:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-14 14:17:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:17:40] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 614 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/78 places, 967/968 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s23 1) (GT 1 s22)), p0:(GT 1 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1180 reset in 459 ms.
Product exploration explored 100000 steps with 1189 reset in 459 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/73 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 51 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-14 14:17:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:17:42] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-14 14:17:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:17:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-14 14:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:17:43] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-14 14:17:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:17:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 146 ms returned sat
[2022-05-14 14:17:43] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 64 ms.
[2022-05-14 14:17:43] [INFO ] Added : 19 causal constraints over 5 iterations in 271 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 79 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-14 14:17:43] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:17:44] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
[2022-05-14 14:17:44] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:44] [INFO ] Implicit Places using invariants in 161 ms returned []
[2022-05-14 14:17:44] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:17:44] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2022-05-14 14:17:44] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-14 14:17:44] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:45] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 967/967 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/73 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 84 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-14 14:17:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:46] [INFO ] Computed 5 place invariants in 38 ms
[2022-05-14 14:17:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:17:46] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-14 14:17:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:17:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 14:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:17:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-14 14:17:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:17:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 149 ms returned sat
[2022-05-14 14:17:46] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 30 ms.
[2022-05-14 14:17:46] [INFO ] Added : 19 causal constraints over 5 iterations in 167 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1180 reset in 395 ms.
Product exploration explored 100000 steps with 1171 reset in 357 ms.
Built C files in :
/tmp/ltsmin14800719858395912807
[2022-05-14 14:17:47] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-14 14:17:47] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:47] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-14 14:17:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:47] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-14 14:17:47] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:48] [INFO ] Built C files in 211ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14800719858395912807
Running compilation step : cd /tmp/ltsmin14800719858395912807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14800719858395912807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14800719858395912807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 85 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-14 14:17:51] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:51] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
[2022-05-14 14:17:51] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:52] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-14 14:17:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:52] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:17:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:17:52] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2022-05-14 14:17:52] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-14 14:17:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-14 14:17:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:17:52] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin15740658627496777807
[2022-05-14 14:17:52] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-14 14:17:52] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:52] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-14 14:17:52] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:52] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-14 14:17:52] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:17:53] [INFO ] Built C files in 211ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15740658627496777807
Running compilation step : cd /tmp/ltsmin15740658627496777807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15740658627496777807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15740658627496777807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 14:17:56] [INFO ] Flatten gal took : 58 ms
[2022-05-14 14:17:56] [INFO ] Flatten gal took : 48 ms
[2022-05-14 14:17:56] [INFO ] Time to serialize gal into /tmp/LTL912553789812518550.gal : 20 ms
[2022-05-14 14:17:56] [INFO ] Time to serialize properties into /tmp/LTL16566769292751760103.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL912553789812518550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16566769292751760103.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9125537...266
Read 1 LTL properties
Checking formula 0 : !((G(F(("(ROUTE_A_0<1)")U((G("(ROUTE_A_0<1)"))||("((SUR_PONT_A_0>1)&&(ROUTE_A_0<1))"))))))
Formula 0 simplified : !GF("(ROUTE_A_0<1)" U ("((SUR_PONT_A_0>1)&&(ROUTE_A_0<1))" | G"(ROUTE_A_0<1)"))
Detected timeout of ITS tools.
[2022-05-14 14:18:11] [INFO ] Flatten gal took : 37 ms
[2022-05-14 14:18:11] [INFO ] Applying decomposition
[2022-05-14 14:18:11] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11472930419202696443.txt' '-o' '/tmp/graph11472930419202696443.bin' '-w' '/tmp/graph11472930419202696443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11472930419202696443.bin' '-l' '-1' '-v' '-w' '/tmp/graph11472930419202696443.weights' '-q' '0' '-e' '0.001'
[2022-05-14 14:18:11] [INFO ] Decomposing Gal with order
[2022-05-14 14:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:18:11] [INFO ] Removed a total of 1793 redundant transitions.
[2022-05-14 14:18:11] [INFO ] Flatten gal took : 214 ms
[2022-05-14 14:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 10 ms.
[2022-05-14 14:18:11] [INFO ] Time to serialize gal into /tmp/LTL1216141524588664779.gal : 2 ms
[2022-05-14 14:18:11] [INFO ] Time to serialize properties into /tmp/LTL9735144862661502563.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1216141524588664779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9735144862661502563.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1216141...245
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.u1.ROUTE_A_0<1)")U((G("(i0.u1.ROUTE_A_0<1)"))||("((u2.SUR_PONT_A_0>1)&&(i0.u1.ROUTE_A_0<1))"))))))
Formula 0 simplified : !GF("(i0.u1.ROUTE_A_0<1)" U ("((u2.SUR_PONT_A_0>1)&&(i0.u1.ROUTE_A_0<1))" | G"(i0.u1.ROUTE_A_0<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5106371669275240866
[2022-05-14 14:18:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5106371669275240866
Running compilation step : cd /tmp/ltsmin5106371669275240866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1694 ms.
Running link step : cd /tmp/ltsmin5106371669275240866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5106371669275240866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04 finished in 62691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 968
Applied a total of 1 rules in 9 ms. Remains 77 /78 variables (removed 1) and now considering 968/968 (removed 0) transitions.
[2022-05-14 14:18:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-14 14:18:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 14:18:42] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
[2022-05-14 14:18:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-14 14:18:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 14:18:42] [INFO ] Implicit Places using invariants in 157 ms returned []
[2022-05-14 14:18:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-14 14:18:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 14:18:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:18:42] [INFO ] Implicit Places using invariants and state equation in 410 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 572 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/78 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/78 places, 968/968 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s48 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 406 ms.
Product exploration explored 100000 steps with 25000 reset in 403 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 1645 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/76 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=47 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-14 14:18:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:44] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-14 14:18:44] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
[2022-05-14 14:18:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-14 14:18:44] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-14 14:18:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 14:18:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:18:45] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2022-05-14 14:18:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-14 14:18:45] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 968/968 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 1645 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/76 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 139 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 414 ms.
Product exploration explored 100000 steps with 25000 reset in 403 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 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 76 transition count 968
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 55 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-14 14:18:47] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:47] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-14 14:18:47] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
[2022-05-14 14:18:48] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-14 14:18:48] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 14:18:48] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 968/968 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 968/968 transitions.
Product exploration explored 100000 steps with 25000 reset in 940 ms.
Product exploration explored 100000 steps with 25000 reset in 872 ms.
Built C files in :
/tmp/ltsmin16807861382621066055
[2022-05-14 14:18:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16807861382621066055
Running compilation step : cd /tmp/ltsmin16807861382621066055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1733 ms.
Running link step : cd /tmp/ltsmin16807861382621066055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16807861382621066055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8723629500443501160.hoa' '--buchi-type=spotba'
LTSmin run took 325 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10 finished in 10276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 76 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 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 73 transition count 966
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 0 with 4 rules applied. Total rules applied 10 place count 71 transition count 964
Applied a total of 10 rules in 96 ms. Remains 71 /78 variables (removed 7) and now considering 964/968 (removed 4) transitions.
[2022-05-14 14:18:52] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-14 14:18:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 14:18:52] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-14 14:18:52] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-14 14:18:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 14:18:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:18:52] [INFO ] Implicit Places using invariants and state equation in 339 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 500 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/78 places, 964/968 transitions.
Applied a total of 0 rules in 42 ms. Remains 70 /70 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 70/78 places, 964/968 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11 finished in 696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Applied a total of 2 rules in 5 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
[2022-05-14 14:18:52] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:18:53] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
[2022-05-14 14:18:53] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:18:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-14 14:18:53] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-14 14:18:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:18:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:18:53] [INFO ] Implicit Places using invariants and state equation in 427 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 577 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/78 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/78 places, 968/968 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s23), p0:(LEQ 3 s46)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12 finished in 964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||p1)))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 967
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 967
Applied a total of 4 rules in 10 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
[2022-05-14 14:18:53] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-14 14:18:53] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:18:54] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
[2022-05-14 14:18:54] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-14 14:18:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:18:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-05-14 14:18:54] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-14 14:18:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:18:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:18:54] [INFO ] Implicit Places using invariants and state equation in 356 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 480 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/78 places, 967/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s22), p0:(LEQ 1 (ADD s46 s47))], 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 50000 reset in 391 ms.
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/73 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 finished in 1774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
[2022-05-14 14:18:55] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4579892450927857187
[2022-05-14 14:18:55] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2022-05-14 14:18:55] [INFO ] Applying decomposition
[2022-05-14 14:18:55] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:18:55] [INFO ] Flatten gal took : 32 ms
[2022-05-14 14:18:55] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2022-05-14 14:18:55] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3982782040864329462.txt' '-o' '/tmp/graph3982782040864329462.bin' '-w' '/tmp/graph3982782040864329462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3982782040864329462.bin' '-l' '-1' '-v' '-w' '/tmp/graph3982782040864329462.weights' '-q' '0' '-e' '0.001'
[2022-05-14 14:18:56] [INFO ] Decomposing Gal with order
[2022-05-14 14:18:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:18:56] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2022-05-14 14:18:56] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:18:56] [INFO ] Built C files in 281ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4579892450927857187
Running compilation step : cd /tmp/ltsmin4579892450927857187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-14 14:18:56] [INFO ] Removed a total of 1871 redundant transitions.
[2022-05-14 14:18:56] [INFO ] Flatten gal took : 198 ms
[2022-05-14 14:18:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 11 ms.
[2022-05-14 14:18:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality2625223239792288369.gal : 1 ms
[2022-05-14 14:18:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality13034241735860674701.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2625223239792288369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13034241735860674701.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i1.u2.ROUTE_A_0<1)")U((G("(i1.u2.ROUTE_A_0<1)"))||("((i2.u0.SUR_PONT_A_0>1)&&(i1.u2.ROUTE_A_0<1))"))))))
Formula 0 simplified : !GF("(i1.u2.ROUTE_A_0<1)" U ("((i2.u0.SUR_PONT_A_0>1)&&(i1.u2.ROUTE_A_0<1))" | G"(i1.u2.ROUTE_A_0<1)"))
Compilation finished in 3828 ms.
Running link step : cd /tmp/ltsmin4579892450927857187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin4579892450927857187;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 14:39:40] [INFO ] Applying decomposition
[2022-05-14 14:39:40] [INFO ] Flatten gal took : 90 ms
[2022-05-14 14:39:40] [INFO ] Decomposing Gal with order
[2022-05-14 14:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:39:41] [INFO ] Removed a total of 5350 redundant transitions.
[2022-05-14 14:39:41] [INFO ] Flatten gal took : 233 ms
[2022-05-14 14:39:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 47 ms.
[2022-05-14 14:39:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality10558338428182293898.gal : 8 ms
[2022-05-14 14:39:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality4494569710769612707.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10558338428182293898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4494569710769612707.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(F(("(ROUTE_A.ROUTE_A_0<1)")U((G("(ROUTE_A.ROUTE_A_0<1)"))||("((SUR_PONT_A.SUR_PONT_A_0>1)&&(ROUTE_A.ROUTE_A_0<1))"))))))
Formula 0 simplified : !GF("(ROUTE_A.ROUTE_A_0<1)" U ("((SUR_PONT_A.SUR_PONT_A_0>1)&&(ROUTE_A.ROUTE_A_0<1))" | G"(ROUTE_A.ROUTE_A_0<1)"))
Detected timeout of ITS tools.
[2022-05-14 15:00:25] [INFO ] Flatten gal took : 95 ms
[2022-05-14 15:00:25] [INFO ] Input system was already deterministic with 968 transitions.
[2022-05-14 15:00:25] [INFO ] Transformed 78 places.
[2022-05-14 15:00:26] [INFO ] Transformed 968 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-14 15:00:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality2771625856492138317.gal : 5 ms
[2022-05-14 15:00:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality8655638909225427434.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2771625856492138317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8655638909225427434.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(ROUTE_A_0<1)")U((G("(ROUTE_A_0<1)"))||("((SUR_PONT_A_0>1)&&(ROUTE_A_0<1))"))))))
Formula 0 simplified : !GF("(ROUTE_A_0<1)" U ("((SUR_PONT_A_0>1)&&(ROUTE_A_0<1))" | G"(ROUTE_A_0<1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-V20P10N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V20P10N20, 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 r024-tall-165251918000027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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