Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593600796.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BART-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593600796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 65M
-rw-r--r-- 1 mcc users 2.9M Feb 26 06:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9M Feb 26 06:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Feb 26 04:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.8M Feb 26 04:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 934K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9M Feb 26 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11M Feb 26 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Feb 26 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.9M Feb 26 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 219K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 442K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678526880415

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 09:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 09:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:28:03] [INFO ] Load time of PNML (sax parser for PT used): 473 ms
[2023-03-11 09:28:03] [INFO ] Transformed 5490 places.
[2023-03-11 09:28:03] [INFO ] Transformed 8080 transitions.
[2023-03-11 09:28:03] [INFO ] Found NUPN structural information;
[2023-03-11 09:28:03] [INFO ] Parsed PT model containing 5490 places and 8080 transitions and 64800 arcs in 674 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 96 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5245 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 70 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2023-03-11 09:28:05] [INFO ] Computed 40 place invariants in 108 ms
[2023-03-11 09:28:06] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2023-03-11 09:28:06] [INFO ] Invariant cache hit.
[2023-03-11 09:28:07] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2023-03-11 09:28:07] [INFO ] Invariant cache hit.
[2023-03-11 09:28:08] [INFO ] Dead Transitions using invariants and state equation in 1180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3662 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Support contains 5245 out of 5280 places after structural reductions.
[2023-03-11 09:28:09] [INFO ] Flatten gal took : 517 ms
[2023-03-11 09:28:11] [INFO ] Flatten gal took : 437 ms
[2023-03-11 09:28:13] [INFO ] Input system was already deterministic with 8080 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-11 09:28:14] [INFO ] Invariant cache hit.
[2023-03-11 09:28:15] [INFO ] [Real]Absence check using 40 positive place invariants in 89 ms returned sat
[2023-03-11 09:28:22] [INFO ] After 6412ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 09:28:23] [INFO ] After 7764ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 597 ms.
[2023-03-11 09:28:24] [INFO ] After 9957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 240 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 16 ms.
FORMULA BART-PT-040-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p0)&&p1)) U (G(X((p1&&G(!p0))))||(X((p1&&G(!p0)))&&(!p0||X((p1 U p0)))))))'
Support contains 3880 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 142 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
[2023-03-11 09:28:25] [INFO ] Invariant cache hit.
[2023-03-11 09:28:26] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2023-03-11 09:28:26] [INFO ] Invariant cache hit.
[2023-03-11 09:28:27] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2023-03-11 09:28:27] [INFO ] Invariant cache hit.
[2023-03-11 09:28:28] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3392 ms. Remains : 5280/5280 places, 8080/8080 transitions.
Stuttering acceptance computed with spot in 599 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : BART-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s898 1) (EQ s4429 1) (EQ s3959 1) (EQ s5232 1) (EQ s4762 1) (EQ s5136 1) (EQ s1054 1) (EQ s4636 1) (EQ s3040 1) (EQ s1840 1) (EQ s1105 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA BART-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-01 finished in 4265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 360 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 920 places :
Symmetric choice reduction at 0 with 920 rule applications. Total rules 920 place count 4360 transition count 7160
Iterating global reduction 0 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Discarding 760 places :
Symmetric choice reduction at 0 with 760 rule applications. Total rules 2600 place count 3600 transition count 6400
Iterating global reduction 0 with 760 rules applied. Total rules applied 3360 place count 3600 transition count 6400
Applied a total of 3360 rules in 1665 ms. Remains 3600 /5280 variables (removed 1680) and now considering 6400/8080 (removed 1680) transitions.
// Phase 1: matrix 6400 rows 3600 cols
[2023-03-11 09:28:30] [INFO ] Computed 40 place invariants in 44 ms
[2023-03-11 09:28:31] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-11 09:28:31] [INFO ] Invariant cache hit.
[2023-03-11 09:28:32] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2023-03-11 09:28:32] [INFO ] Invariant cache hit.
[2023-03-11 09:28:41] [INFO ] Dead Transitions using invariants and state equation in 9192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3600/5280 places, 6400/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12515 ms. Remains : 3600/5280 places, 6400/8080 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s237 1) (EQ s621 1) (EQ s1334 1) (EQ s318 1) (EQ s518 1) (EQ s1320 1) (EQ s607 1) (EQ s1220 1) (EQ s964 1) (EQ s1092 1) (EQ s208 1) (EQ s993 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1402 reset in 4437 ms.
Product exploration explored 100000 steps with 1411 reset in 4142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
[2023-03-11 09:28:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 360 out of 3600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3600/3600 places, 6400/6400 transitions.
Graph (trivial) has 5640 edges and 3600 vertex of which 1640 / 3600 are part of one of the 40 SCC in 17 ms
Free SCC test removed 1600 places
Ensure Unique test removed 3000 transitions
Reduce isomorphic transitions removed 3000 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 401 place count 2000 transition count 3000
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 1000 rules applied. Total rules applied 1401 place count 1600 transition count 2400
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 2 with 600 rules applied. Total rules applied 2001 place count 1360 transition count 2040
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 3 with 480 rules applied. Total rules applied 2481 place count 1200 transition count 1720
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 4 with 480 rules applied. Total rules applied 2961 place count 1040 transition count 1400
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 5 with 400 rules applied. Total rules applied 3361 place count 880 transition count 1160
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 6 with 120 rules applied. Total rules applied 3481 place count 760 transition count 1160
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 3521 place count 760 transition count 1120
Applied a total of 3521 rules in 167 ms. Remains 760 /3600 variables (removed 2840) and now considering 1120/6400 (removed 5280) transitions.
[2023-03-11 09:29:08] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
// Phase 1: matrix 1081 rows 760 cols
[2023-03-11 09:29:08] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-11 09:29:08] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-11 09:29:08] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2023-03-11 09:29:08] [INFO ] Invariant cache hit.
[2023-03-11 09:29:09] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-11 09:29:09] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-11 09:29:09] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2023-03-11 09:29:09] [INFO ] Invariant cache hit.
[2023-03-11 09:29:09] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/3600 places, 1120/6400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1512 ms. Remains : 760/3600 places, 1120/6400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-11 09:29:10] [INFO ] Flow matrix only has 1081 transitions (discarded 39 similar events)
[2023-03-11 09:29:11] [INFO ] Invariant cache hit.
[2023-03-11 09:29:18] [INFO ] [Real]Absence check using 40 positive place invariants in 61 ms returned sat
[2023-03-11 09:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:29:19] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2023-03-11 09:29:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:29:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 64 ms returned sat
[2023-03-11 09:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:29:27] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2023-03-11 09:29:28] [INFO ] Computed and/alt/rep : 720/1000/720 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-11 09:29:29] [INFO ] Added : 64 causal constraints over 13 iterations in 1044 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-03 finished in 59989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3080 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Iterating post reduction 0 with 960 rules applied. Total rules applied 960 place count 5280 transition count 7120
Reduce places removed 960 places and 0 transitions.
Iterating post reduction 1 with 960 rules applied. Total rules applied 1920 place count 4320 transition count 7120
Applied a total of 1920 rules in 748 ms. Remains 4320 /5280 variables (removed 960) and now considering 7120/8080 (removed 960) transitions.
// Phase 1: matrix 7120 rows 4320 cols
[2023-03-11 09:29:30] [INFO ] Computed 40 place invariants in 40 ms
[2023-03-11 09:29:30] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-11 09:29:30] [INFO ] Invariant cache hit.
[2023-03-11 09:29:31] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2023-03-11 09:29:32] [INFO ] Redundant transitions in 702 ms returned []
[2023-03-11 09:29:32] [INFO ] Invariant cache hit.
[2023-03-11 09:29:38] [INFO ] Dead Transitions using invariants and state equation in 6095 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4320/5280 places, 7120/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9118 ms. Remains : 4320/5280 places, 7120/8080 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s197 1) (EQ s581 1) (EQ s1454 1) (EQ s278 1) (EQ s478 1) (EQ s1440 1) (EQ s567 1) (EQ s1300 1) (EQ s964 1) (EQ s1132 1) (EQ s168 1) (EQ s993 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 950 ms.
Product exploration explored 100000 steps with 0 reset in 1217 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
[2023-03-11 09:30:07] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3080 out of 4320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4320/4320 places, 7120/7120 transitions.
Applied a total of 0 rules in 140 ms. Remains 4320 /4320 variables (removed 0) and now considering 7120/7120 (removed 0) transitions.
[2023-03-11 09:30:22] [INFO ] Invariant cache hit.
[2023-03-11 09:30:22] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-11 09:30:22] [INFO ] Invariant cache hit.
[2023-03-11 09:30:24] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2023-03-11 09:30:24] [INFO ] Redundant transitions in 557 ms returned []
[2023-03-11 09:30:24] [INFO ] Invariant cache hit.
[2023-03-11 09:30:31] [INFO ] Dead Transitions using invariants and state equation in 7306 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9767 ms. Remains : 4320/4320 places, 7120/7120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 332 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
[2023-03-11 09:30:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1017 ms.
Product exploration explored 100000 steps with 0 reset in 1076 ms.
Built C files in :
/tmp/ltsmin15961466935422126636
[2023-03-11 09:31:14] [INFO ] Too many transitions (7120) to apply POR reductions. Disabling POR matrices.
[2023-03-11 09:31:14] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15961466935422126636
Running compilation step : cd /tmp/ltsmin15961466935422126636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15961466935422126636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15961466935422126636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3080 out of 4320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4320/4320 places, 7120/7120 transitions.
Applied a total of 0 rules in 115 ms. Remains 4320 /4320 variables (removed 0) and now considering 7120/7120 (removed 0) transitions.
[2023-03-11 09:31:17] [INFO ] Invariant cache hit.
[2023-03-11 09:31:18] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-11 09:31:18] [INFO ] Invariant cache hit.
[2023-03-11 09:31:19] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2023-03-11 09:31:19] [INFO ] Redundant transitions in 511 ms returned []
[2023-03-11 09:31:19] [INFO ] Invariant cache hit.
[2023-03-11 09:31:20] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2998 ms. Remains : 4320/4320 places, 7120/7120 transitions.
Built C files in :
/tmp/ltsmin16497879487471951643
[2023-03-11 09:31:20] [INFO ] Too many transitions (7120) to apply POR reductions. Disabling POR matrices.
[2023-03-11 09:31:20] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16497879487471951643
Running compilation step : cd /tmp/ltsmin16497879487471951643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16497879487471951643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16497879487471951643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 09:31:24] [INFO ] Flatten gal took : 151 ms
[2023-03-11 09:31:24] [INFO ] Flatten gal took : 130 ms
[2023-03-11 09:31:24] [INFO ] Time to serialize gal into /tmp/LTL2864838893296966168.gal : 51 ms
[2023-03-11 09:31:24] [INFO ] Time to serialize properties into /tmp/LTL3564320593399504477.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2864838893296966168.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9454439921904514523.hoa' '-atoms' '/tmp/LTL3564320593399504477.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3564320593399504477.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9454439921904514523.hoa
Detected timeout of ITS tools.
[2023-03-11 09:31:39] [INFO ] Flatten gal took : 153 ms
[2023-03-11 09:31:40] [INFO ] Flatten gal took : 165 ms
[2023-03-11 09:31:40] [INFO ] Time to serialize gal into /tmp/LTL14760878341612655292.gal : 34 ms
[2023-03-11 09:31:40] [INFO ] Time to serialize properties into /tmp/LTL832660591896129247.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14760878341612655292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL832660591896129247.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((TrainState_38_2_4==1)||(TrainState_22_3_8==1))||((TrainState_15_4_14==1)||(TrainState_39_2_5==1)))||(((TrainState...81817
Formula 0 simplified : FG!"(((((((((((((TrainState_38_2_4==1)||(TrainState_22_3_8==1))||((TrainState_15_4_14==1)||(TrainState_39_2_5==1)))||(((TrainState_3...81811
Detected timeout of ITS tools.
[2023-03-11 09:31:55] [INFO ] Flatten gal took : 147 ms
[2023-03-11 09:31:55] [INFO ] Applying decomposition
[2023-03-11 09:31:55] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1295044916602929270.txt' '-o' '/tmp/graph1295044916602929270.bin' '-w' '/tmp/graph1295044916602929270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1295044916602929270.bin' '-l' '-1' '-v' '-w' '/tmp/graph1295044916602929270.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:31:56] [INFO ] Decomposing Gal with order
[2023-03-11 09:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:31:57] [INFO ] Removed a total of 667 redundant transitions.
[2023-03-11 09:31:57] [INFO ] Flatten gal took : 511 ms
[2023-03-11 09:31:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 49 ms.
[2023-03-11 09:31:58] [INFO ] Time to serialize gal into /tmp/LTL15348286176860851432.gal : 67 ms
[2023-03-11 09:31:58] [INFO ] Time to serialize properties into /tmp/LTL1671135827514502582.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15348286176860851432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1671135827514502582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((i16.u75.TrainState_38_2_4==1)||(i32.u285.TrainState_22_3_8==1))||((i22.u488.TrainState_15_4_14==1)||(i17.u62.Trai...110692
Formula 0 simplified : FG!"(((((((((((((i16.u75.TrainState_38_2_4==1)||(i32.u285.TrainState_22_3_8==1))||((i22.u488.TrainState_15_4_14==1)||(i17.u62.TrainS...110686
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
514 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.79462,73568,1,0,60566,11454,41374,56853,2386,25794,200988
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-040-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-040-LTLFireability-04 finished in 155070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 40 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Drop transitions removed 2560 transitions
Trivial Post-agglo rules discarded 2560 transitions
Performed 2560 trivial Post agglomeration. Transition count delta: 2560
Iterating post reduction 0 with 2560 rules applied. Total rules applied 2560 place count 5280 transition count 5520
Reduce places removed 2560 places and 0 transitions.
Iterating post reduction 1 with 2560 rules applied. Total rules applied 5120 place count 2720 transition count 5520
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 5120 place count 2720 transition count 5360
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 5440 place count 2560 transition count 5360
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 5680 place count 2320 transition count 5120
Iterating global reduction 2 with 240 rules applied. Total rules applied 5920 place count 2320 transition count 5120
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 5960 place count 2320 transition count 5080
Discarding 160 places :
Symmetric choice reduction at 3 with 160 rule applications. Total rules 6120 place count 2160 transition count 4920
Iterating global reduction 3 with 160 rules applied. Total rules applied 6280 place count 2160 transition count 4920
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 6400 place count 2040 transition count 4800
Iterating global reduction 3 with 120 rules applied. Total rules applied 6520 place count 2040 transition count 4800
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 6640 place count 1920 transition count 4680
Iterating global reduction 3 with 120 rules applied. Total rules applied 6760 place count 1920 transition count 4680
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 6840 place count 1840 transition count 4600
Iterating global reduction 3 with 80 rules applied. Total rules applied 6920 place count 1840 transition count 4600
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 7000 place count 1760 transition count 4520
Iterating global reduction 3 with 80 rules applied. Total rules applied 7080 place count 1760 transition count 4520
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 7120 place count 1720 transition count 4480
Iterating global reduction 3 with 40 rules applied. Total rules applied 7160 place count 1720 transition count 4480
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 1 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 7720 place count 1440 transition count 4200
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 3 with 160 rules applied. Total rules applied 7880 place count 1440 transition count 4040
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 8040 place count 1360 transition count 3960
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 4 with 160 rules applied. Total rules applied 8200 place count 1360 transition count 3800
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 5 with 160 rules applied. Total rules applied 8360 place count 1280 transition count 3720
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 5 with 160 rules applied. Total rules applied 8520 place count 1280 transition count 3560
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 160 rules applied. Total rules applied 8680 place count 1200 transition count 3480
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 6 with 160 rules applied. Total rules applied 8840 place count 1200 transition count 3320
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 160 rules applied. Total rules applied 9000 place count 1120 transition count 3240
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 7 with 160 rules applied. Total rules applied 9160 place count 1120 transition count 3080
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 8 with 160 rules applied. Total rules applied 9320 place count 1040 transition count 3000
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 8 with 160 rules applied. Total rules applied 9480 place count 1040 transition count 2840
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 9 with 160 rules applied. Total rules applied 9640 place count 960 transition count 2760
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 9 with 160 rules applied. Total rules applied 9800 place count 960 transition count 2600
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 10 with 160 rules applied. Total rules applied 9960 place count 880 transition count 2520
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 10 with 160 rules applied. Total rules applied 10120 place count 880 transition count 2360
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 11 with 160 rules applied. Total rules applied 10280 place count 800 transition count 2280
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 11 with 160 rules applied. Total rules applied 10440 place count 800 transition count 2120
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 12 with 160 rules applied. Total rules applied 10600 place count 720 transition count 2040
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 12 with 160 rules applied. Total rules applied 10760 place count 720 transition count 1880
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 13 with 160 rules applied. Total rules applied 10920 place count 640 transition count 1800
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 13 with 160 rules applied. Total rules applied 11080 place count 640 transition count 1640
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 14 with 160 rules applied. Total rules applied 11240 place count 560 transition count 1560
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 14 with 160 rules applied. Total rules applied 11400 place count 560 transition count 1400
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 15 with 160 rules applied. Total rules applied 11560 place count 480 transition count 1320
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 15 with 160 rules applied. Total rules applied 11720 place count 480 transition count 1160
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 16 with 160 rules applied. Total rules applied 11880 place count 400 transition count 1080
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 16 with 160 rules applied. Total rules applied 12040 place count 400 transition count 920
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 17 with 160 rules applied. Total rules applied 12200 place count 320 transition count 840
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 17 with 160 rules applied. Total rules applied 12360 place count 320 transition count 680
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 18 with 160 rules applied. Total rules applied 12520 place count 240 transition count 600
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 18 with 160 rules applied. Total rules applied 12680 place count 240 transition count 440
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 19 with 160 rules applied. Total rules applied 12840 place count 160 transition count 360
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 19 with 200 rules applied. Total rules applied 13040 place count 160 transition count 160
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 20 with 80 rules applied. Total rules applied 13120 place count 120 transition count 120
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 40 Pre rules applied. Total rules applied 13120 place count 120 transition count 80
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 21 with 80 rules applied. Total rules applied 13200 place count 80 transition count 80
Applied a total of 13200 rules in 1897 ms. Remains 80 /5280 variables (removed 5200) and now considering 80/8080 (removed 8000) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-11 09:32:06] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-11 09:32:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 09:32:06] [INFO ] Invariant cache hit.
[2023-03-11 09:32:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-11 09:32:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:32:06] [INFO ] Invariant cache hit.
[2023-03-11 09:32:06] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/5280 places, 80/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2103 ms. Remains : 80/5280 places, 80/8080 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s65 1) (EQ s64 1) (EQ s67 1) (EQ s66 1) (EQ s69 1) (EQ s68 1) (EQ s71 1) (EQ s70 1) (EQ s73 1) (EQ s72 1) (EQ s75 1) (EQ s74 1) (EQ s77 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Product exploration explored 100000 steps with 0 reset in 468 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), true, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), true, (NOT p0)]
[2023-03-11 09:32:08] [INFO ] Invariant cache hit.
[2023-03-11 09:32:08] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2023-03-11 09:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:08] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-11 09:32:08] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-11 09:32:08] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-11 09:32:08] [INFO ] Invariant cache hit.
[2023-03-11 09:32:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-11 09:32:08] [INFO ] Invariant cache hit.
[2023-03-11 09:32:09] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-11 09:32:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:32:09] [INFO ] Invariant cache hit.
[2023-03-11 09:32:09] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 687 ms. Remains : 80/80 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), true, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 300 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), true, (NOT p0)]
[2023-03-11 09:32:10] [INFO ] Invariant cache hit.
[2023-03-11 09:32:10] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2023-03-11 09:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:10] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-11 09:32:10] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-11 09:32:10] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 0 reset in 361 ms.
Built C files in :
/tmp/ltsmin8431083767485870863
[2023-03-11 09:32:11] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2023-03-11 09:32:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:32:11] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2023-03-11 09:32:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:32:11] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2023-03-11 09:32:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 09:32:11] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8431083767485870863
Running compilation step : cd /tmp/ltsmin8431083767485870863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 252 ms.
Running link step : cd /tmp/ltsmin8431083767485870863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin8431083767485870863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased962707656092466322.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA BART-PT-040-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-040-LTLFireability-06 finished in 7989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&((p0 U p2)||p1)))))'
Support contains 3560 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 360 places :
Symmetric choice reduction at 0 with 360 rule applications. Total rules 360 place count 4920 transition count 7720
Iterating global reduction 0 with 360 rules applied. Total rules applied 720 place count 4920 transition count 7720
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 960 place count 4680 transition count 7480
Iterating global reduction 0 with 240 rules applied. Total rules applied 1200 place count 4680 transition count 7480
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 1320 place count 4560 transition count 7360
Iterating global reduction 0 with 120 rules applied. Total rules applied 1440 place count 4560 transition count 7360
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 1560 place count 4440 transition count 7240
Iterating global reduction 0 with 120 rules applied. Total rules applied 1680 place count 4440 transition count 7240
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 1800 place count 4320 transition count 7120
Iterating global reduction 0 with 120 rules applied. Total rules applied 1920 place count 4320 transition count 7120
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 2040 place count 4200 transition count 7000
Iterating global reduction 0 with 120 rules applied. Total rules applied 2160 place count 4200 transition count 7000
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2240 place count 4120 transition count 6920
Iterating global reduction 0 with 80 rules applied. Total rules applied 2320 place count 4120 transition count 6920
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2400 place count 4040 transition count 6840
Iterating global reduction 0 with 80 rules applied. Total rules applied 2480 place count 4040 transition count 6840
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 2520 place count 4000 transition count 6800
Iterating global reduction 0 with 40 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Applied a total of 2560 rules in 369 ms. Remains 4000 /5280 variables (removed 1280) and now considering 6800/8080 (removed 1280) transitions.
// Phase 1: matrix 6800 rows 4000 cols
[2023-03-11 09:32:12] [INFO ] Computed 40 place invariants in 44 ms
[2023-03-11 09:32:13] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-11 09:32:13] [INFO ] Invariant cache hit.
[2023-03-11 09:32:15] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
[2023-03-11 09:32:15] [INFO ] Invariant cache hit.
[2023-03-11 09:32:22] [INFO ] Dead Transitions using invariants and state equation in 7277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4000/5280 places, 6800/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10088 ms. Remains : 4000/5280 places, 6800/8080 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s538 1) (EQ s3229 1) (EQ s2839 1) (EQ s3952 1) (EQ s3482 1) (EQ s3856 1) (EQ s614 1) (EQ s3396 1) (EQ s2080 1) (EQ s1120 1) (EQ s665 1) (EQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3536 ms.
Product exploration explored 100000 steps with 0 reset in 3635 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 1222 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:33:53] [INFO ] Invariant cache hit.
[2023-03-11 09:33:59] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 1022 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-11 09:35:03] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-11 09:35:18] [INFO ] Invariant cache hit.
[2023-03-11 09:35:23] [INFO ] [Real]Absence check using 40 positive place invariants in 56 ms returned sat
[2023-03-11 09:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:35:27] [INFO ] [Real]Absence check using state equation in 3291 ms returned sat
[2023-03-11 09:35:28] [INFO ] Computed and/alt/rep : 5360/9520/5360 causal constraints (skipped 0 transitions) in 438 ms.
[2023-03-11 09:35:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:35:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 92 ms returned sat
[2023-03-11 09:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:35:39] [INFO ] [Nat]Absence check using state equation in 4644 ms returned sat
[2023-03-11 09:35:39] [INFO ] Computed and/alt/rep : 5360/9520/5360 causal constraints (skipped 0 transitions) in 450 ms.
[2023-03-11 09:35:49] [INFO ] Deduced a trap composed of 100 places in 4761 ms of which 45 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 09:35:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 3560 out of 4000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4000/4000 places, 6800/6800 transitions.
Applied a total of 0 rules in 30 ms. Remains 4000 /4000 variables (removed 0) and now considering 6800/6800 (removed 0) transitions.
[2023-03-11 09:35:49] [INFO ] Invariant cache hit.
[2023-03-11 09:35:49] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-11 09:35:49] [INFO ] Invariant cache hit.
[2023-03-11 09:35:50] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2023-03-11 09:35:50] [INFO ] Invariant cache hit.
[2023-03-11 09:35:56] [INFO ] Dead Transitions using invariants and state equation in 6425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7773 ms. Remains : 4000/4000 places, 6800/6800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 1 factoid took 526 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 24 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 479 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-11 09:36:12] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-11 09:36:27] [INFO ] Invariant cache hit.
[2023-03-11 09:36:31] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2023-03-11 09:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:36:35] [INFO ] [Real]Absence check using state equation in 3600 ms returned sat
[2023-03-11 09:36:36] [INFO ] Computed and/alt/rep : 5360/9520/5360 causal constraints (skipped 0 transitions) in 406 ms.
[2023-03-11 09:36:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:36:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 58 ms returned sat
[2023-03-11 09:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:36:45] [INFO ] [Nat]Absence check using state equation in 2931 ms returned sat
[2023-03-11 09:36:46] [INFO ] Computed and/alt/rep : 5360/9520/5360 causal constraints (skipped 0 transitions) in 363 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 09:36:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 3642 ms.
Product exploration explored 100000 steps with 2 reset in 3636 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 3560 out of 4000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4000/4000 places, 6800/6800 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 4000 transition count 6800
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 40 place count 4000 transition count 6800
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 4000 transition count 6800
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 120 place count 3960 transition count 6760
Deduced a syphon composed of 40 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 160 place count 3960 transition count 6760
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 320 places in 2 ms
Iterating global reduction 1 with 280 rules applied. Total rules applied 440 place count 3960 transition count 6760
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 480 place count 3960 transition count 6720
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 720 place count 3720 transition count 6480
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 960 place count 3720 transition count 6480
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 960 rules in 573 ms. Remains 3720 /4000 variables (removed 280) and now considering 6480/6800 (removed 320) transitions.
[2023-03-11 09:37:01] [INFO ] Redundant transitions in 414 ms returned []
// Phase 1: matrix 6480 rows 3720 cols
[2023-03-11 09:37:01] [INFO ] Computed 40 place invariants in 26 ms
[2023-03-11 09:37:05] [INFO ] Dead Transitions using invariants and state equation in 3918 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3720/4000 places, 6480/6800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4919 ms. Remains : 3720/4000 places, 6480/6800 transitions.
Built C files in :
/tmp/ltsmin15153683506010721142
[2023-03-11 09:37:05] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15153683506010721142
Running compilation step : cd /tmp/ltsmin15153683506010721142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin15153683506010721142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15153683506010721142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3560 out of 4000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4000/4000 places, 6800/6800 transitions.
Applied a total of 0 rules in 32 ms. Remains 4000 /4000 variables (removed 0) and now considering 6800/6800 (removed 0) transitions.
// Phase 1: matrix 6800 rows 4000 cols
[2023-03-11 09:37:08] [INFO ] Computed 40 place invariants in 48 ms
[2023-03-11 09:37:08] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-11 09:37:08] [INFO ] Invariant cache hit.
[2023-03-11 09:37:10] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2023-03-11 09:37:10] [INFO ] Invariant cache hit.
[2023-03-11 09:37:16] [INFO ] Dead Transitions using invariants and state equation in 5636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7668 ms. Remains : 4000/4000 places, 6800/6800 transitions.
Built C files in :
/tmp/ltsmin7604738866033857197
[2023-03-11 09:37:16] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7604738866033857197
Running compilation step : cd /tmp/ltsmin7604738866033857197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7604738866033857197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7604738866033857197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 09:37:19] [INFO ] Flatten gal took : 136 ms
[2023-03-11 09:37:19] [INFO ] Flatten gal took : 189 ms
[2023-03-11 09:37:19] [INFO ] Time to serialize gal into /tmp/LTL15847719781386636143.gal : 66 ms
[2023-03-11 09:37:19] [INFO ] Time to serialize properties into /tmp/LTL9364729064200576849.prop : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15847719781386636143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6662240556260895089.hoa' '-atoms' '/tmp/LTL9364729064200576849.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9364729064200576849.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6662240556260895089.hoa
Detected timeout of ITS tools.
[2023-03-11 09:37:35] [INFO ] Flatten gal took : 181 ms
[2023-03-11 09:37:35] [INFO ] Flatten gal took : 190 ms
[2023-03-11 09:37:35] [INFO ] Time to serialize gal into /tmp/LTL8365188468963604281.gal : 26 ms
[2023-03-11 09:37:35] [INFO ] Time to serialize properties into /tmp/LTL4776686192286118553.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8365188468963604281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4776686192286118553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((((((TrainState_19_1_11==1)||(TrainState_30_1_33==1))||((TrainState_40_1_30==1)||(TrainState_33_2_39==1)))||(((Trai...190286
Formula 0 simplified : XG(F!"(((((((((((((TrainState_19_1_11==1)||(TrainState_30_1_33==1))||((TrainState_40_1_30==1)||(TrainState_33_2_39==1)))||(((TrainSt...190277
Detected timeout of ITS tools.
[2023-03-11 09:37:51] [INFO ] Flatten gal took : 184 ms
[2023-03-11 09:37:51] [INFO ] Applying decomposition
[2023-03-11 09:37:51] [INFO ] Flatten gal took : 159 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12891014157111249339.txt' '-o' '/tmp/graph12891014157111249339.bin' '-w' '/tmp/graph12891014157111249339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12891014157111249339.bin' '-l' '-1' '-v' '-w' '/tmp/graph12891014157111249339.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:37:51] [INFO ] Decomposing Gal with order
[2023-03-11 09:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:37:52] [INFO ] Removed a total of 1619 redundant transitions.
[2023-03-11 09:37:53] [INFO ] Flatten gal took : 368 ms
[2023-03-11 09:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 39 ms.
[2023-03-11 09:37:56] [INFO ] Time to serialize gal into /tmp/LTL2254739924041243161.gal : 92 ms
[2023-03-11 09:37:56] [INFO ] Time to serialize properties into /tmp/LTL6998362646135024108.ltl : 27 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2254739924041243161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6998362646135024108.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((((((i38.i1.u88.TrainState_19_1_11==1)||(i30.i0.u916.TrainState_30_1_33==1))||((i12.i0.u732.TrainState_40_1_30==1)|...273220
Formula 0 simplified : XG(F!"(((((((((((((i38.i1.u88.TrainState_19_1_11==1)||(i30.i0.u916.TrainState_30_1_33==1))||((i12.i0.u732.TrainState_40_1_30==1)||(i...273211
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11131345797590961024
[2023-03-11 09:38:11] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11131345797590961024
Running compilation step : cd /tmp/ltsmin11131345797590961024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11131345797590961024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11131345797590961024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BART-PT-040-LTLFireability-07 finished in 362184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 2 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3638 place count 2921 transition count 5721
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4718 place count 2921 transition count 5721
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4877 place count 2762 transition count 5562
Iterating global reduction 0 with 159 rules applied. Total rules applied 5036 place count 2762 transition count 5562
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5155 place count 2643 transition count 5443
Iterating global reduction 0 with 119 rules applied. Total rules applied 5274 place count 2643 transition count 5443
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5393 place count 2524 transition count 5324
Iterating global reduction 0 with 119 rules applied. Total rules applied 5512 place count 2524 transition count 5324
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5631 place count 2405 transition count 5205
Iterating global reduction 0 with 119 rules applied. Total rules applied 5750 place count 2405 transition count 5205
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5869 place count 2286 transition count 5086
Iterating global reduction 0 with 119 rules applied. Total rules applied 5988 place count 2286 transition count 5086
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6107 place count 2167 transition count 4967
Iterating global reduction 0 with 119 rules applied. Total rules applied 6226 place count 2167 transition count 4967
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6305 place count 2088 transition count 4888
Iterating global reduction 0 with 79 rules applied. Total rules applied 6384 place count 2088 transition count 4888
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6463 place count 2009 transition count 4809
Iterating global reduction 0 with 79 rules applied. Total rules applied 6542 place count 2009 transition count 4809
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6582 place count 1969 transition count 4769
Iterating global reduction 0 with 40 rules applied. Total rules applied 6622 place count 1969 transition count 4769
Applied a total of 6622 rules in 1761 ms. Remains 1969 /5280 variables (removed 3311) and now considering 4769/8080 (removed 3311) transitions.
// Phase 1: matrix 4769 rows 1969 cols
[2023-03-11 09:38:16] [INFO ] Computed 40 place invariants in 12 ms
[2023-03-11 09:38:16] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-11 09:38:16] [INFO ] Invariant cache hit.
[2023-03-11 09:38:17] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-11 09:38:17] [INFO ] Invariant cache hit.
[2023-03-11 09:38:19] [INFO ] Dead Transitions using invariants and state equation in 2221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1969/5280 places, 4769/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5315 ms. Remains : 1969/5280 places, 4769/8080 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : BART-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s440 1), p0:(EQ s929 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 904 ms.
Product exploration explored 100000 steps with 31 reset in 938 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 528 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :3
Finished Best-First random walk after 1441 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=480 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 738 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-11 09:38:26] [INFO ] Invariant cache hit.
[2023-03-11 09:38:27] [INFO ] [Real]Absence check using 40 positive place invariants in 2 ms returned unsat
Proved EG (NOT p1)
[2023-03-11 09:38:27] [INFO ] Invariant cache hit.
[2023-03-11 09:38:29] [INFO ] [Real]Absence check using 40 positive place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 418 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-040-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-08 finished in 15086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1&&F(p2))))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3637 place count 2922 transition count 5722
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4716 place count 2922 transition count 5722
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4876 place count 2762 transition count 5562
Iterating global reduction 0 with 160 rules applied. Total rules applied 5036 place count 2762 transition count 5562
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5155 place count 2643 transition count 5443
Iterating global reduction 0 with 119 rules applied. Total rules applied 5274 place count 2643 transition count 5443
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5393 place count 2524 transition count 5324
Iterating global reduction 0 with 119 rules applied. Total rules applied 5512 place count 2524 transition count 5324
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5631 place count 2405 transition count 5205
Iterating global reduction 0 with 119 rules applied. Total rules applied 5750 place count 2405 transition count 5205
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5869 place count 2286 transition count 5086
Iterating global reduction 0 with 119 rules applied. Total rules applied 5988 place count 2286 transition count 5086
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6107 place count 2167 transition count 4967
Iterating global reduction 0 with 119 rules applied. Total rules applied 6226 place count 2167 transition count 4967
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6306 place count 2087 transition count 4887
Iterating global reduction 0 with 80 rules applied. Total rules applied 6386 place count 2087 transition count 4887
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6465 place count 2008 transition count 4808
Iterating global reduction 0 with 79 rules applied. Total rules applied 6544 place count 2008 transition count 4808
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6584 place count 1968 transition count 4768
Iterating global reduction 0 with 40 rules applied. Total rules applied 6624 place count 1968 transition count 4768
Applied a total of 6624 rules in 1645 ms. Remains 1968 /5280 variables (removed 3312) and now considering 4768/8080 (removed 3312) transitions.
// Phase 1: matrix 4768 rows 1968 cols
[2023-03-11 09:38:31] [INFO ] Computed 40 place invariants in 45 ms
[2023-03-11 09:38:31] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-11 09:38:31] [INFO ] Invariant cache hit.
[2023-03-11 09:38:32] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2023-03-11 09:38:32] [INFO ] Invariant cache hit.
[2023-03-11 09:38:35] [INFO ] Dead Transitions using invariants and state equation in 2558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1968/5280 places, 4768/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5976 ms. Remains : 1968/5280 places, 4768/8080 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s680 0), p1:(EQ s34 0), p2:(EQ s1331 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BART-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-09 finished in 6339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1279 places :
Symmetric choice reduction at 0 with 1279 rule applications. Total rules 1279 place count 4001 transition count 6801
Iterating global reduction 0 with 1279 rules applied. Total rules applied 2558 place count 4001 transition count 6801
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3637 place count 2922 transition count 5722
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4716 place count 2922 transition count 5722
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4875 place count 2763 transition count 5563
Iterating global reduction 0 with 159 rules applied. Total rules applied 5034 place count 2763 transition count 5563
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5153 place count 2644 transition count 5444
Iterating global reduction 0 with 119 rules applied. Total rules applied 5272 place count 2644 transition count 5444
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5391 place count 2525 transition count 5325
Iterating global reduction 0 with 119 rules applied. Total rules applied 5510 place count 2525 transition count 5325
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5629 place count 2406 transition count 5206
Iterating global reduction 0 with 119 rules applied. Total rules applied 5748 place count 2406 transition count 5206
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5867 place count 2287 transition count 5087
Iterating global reduction 0 with 119 rules applied. Total rules applied 5986 place count 2287 transition count 5087
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6105 place count 2168 transition count 4968
Iterating global reduction 0 with 119 rules applied. Total rules applied 6224 place count 2168 transition count 4968
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6303 place count 2089 transition count 4889
Iterating global reduction 0 with 79 rules applied. Total rules applied 6382 place count 2089 transition count 4889
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6461 place count 2010 transition count 4810
Iterating global reduction 0 with 79 rules applied. Total rules applied 6540 place count 2010 transition count 4810
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6580 place count 1970 transition count 4770
Iterating global reduction 0 with 40 rules applied. Total rules applied 6620 place count 1970 transition count 4770
Applied a total of 6620 rules in 1951 ms. Remains 1970 /5280 variables (removed 3310) and now considering 4770/8080 (removed 3310) transitions.
// Phase 1: matrix 4770 rows 1970 cols
[2023-03-11 09:38:37] [INFO ] Computed 40 place invariants in 34 ms
[2023-03-11 09:38:38] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-11 09:38:38] [INFO ] Invariant cache hit.
[2023-03-11 09:38:38] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-03-11 09:38:38] [INFO ] Invariant cache hit.
[2023-03-11 09:38:41] [INFO ] Dead Transitions using invariants and state equation in 2081 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1970/5280 places, 4770/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5135 ms. Remains : 1970/5280 places, 4770/8080 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s943 0), p0:(EQ s320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 90 reset in 1123 ms.
Product exploration explored 100000 steps with 103 reset in 903 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 408 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2959 steps, including 0 resets, run visited all 2 properties in 230 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 420 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1970 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1970/1970 places, 4770/4770 transitions.
Applied a total of 0 rules in 95 ms. Remains 1970 /1970 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
[2023-03-11 09:38:46] [INFO ] Invariant cache hit.
[2023-03-11 09:38:46] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-11 09:38:46] [INFO ] Invariant cache hit.
[2023-03-11 09:38:48] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2023-03-11 09:38:48] [INFO ] Invariant cache hit.
[2023-03-11 09:38:50] [INFO ] Dead Transitions using invariants and state equation in 2273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4056 ms. Remains : 1970/1970 places, 4770/4770 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 410 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9057 steps, including 2 resets, run visited all 2 properties in 125 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 348 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 85 reset in 1062 ms.
Product exploration explored 100000 steps with 84 reset in 966 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1970 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1970/1970 places, 4770/4770 transitions.
Graph (trivial) has 4764 edges and 1970 vertex of which 1959 / 1970 are part of one of the 40 SCC in 3 ms
Free SCC test removed 1919 places
Ensure Unique test removed 4710 transitions
Reduce isomorphic transitions removed 4710 transitions.
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 13 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 13 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 13 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 13 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 13 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 53 place count 13 transition count 16
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 59 place count 7 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 7 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 7 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 7 transition count 8
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 72 rules in 55 ms. Remains 5 /1970 variables (removed 1965) and now considering 6/4770 (removed 4764) transitions.
[2023-03-11 09:38:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2023-03-11 09:38:56] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 09:38:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1970 places, 6/4770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 5/1970 places, 6/4770 transitions.
Built C files in :
/tmp/ltsmin14041227696850667291
[2023-03-11 09:38:56] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14041227696850667291
Running compilation step : cd /tmp/ltsmin14041227696850667291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin14041227696850667291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14041227696850667291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1970 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1970/1970 places, 4770/4770 transitions.
Applied a total of 0 rules in 110 ms. Remains 1970 /1970 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
// Phase 1: matrix 4770 rows 1970 cols
[2023-03-11 09:38:59] [INFO ] Computed 40 place invariants in 31 ms
[2023-03-11 09:39:00] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-11 09:39:00] [INFO ] Invariant cache hit.
[2023-03-11 09:39:00] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-11 09:39:00] [INFO ] Invariant cache hit.
[2023-03-11 09:39:03] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3583 ms. Remains : 1970/1970 places, 4770/4770 transitions.
Built C files in :
/tmp/ltsmin2435317066880309216
[2023-03-11 09:39:03] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2435317066880309216
Running compilation step : cd /tmp/ltsmin2435317066880309216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2435317066880309216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2435317066880309216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 09:39:06] [INFO ] Flatten gal took : 86 ms
[2023-03-11 09:39:06] [INFO ] Flatten gal took : 96 ms
[2023-03-11 09:39:06] [INFO ] Time to serialize gal into /tmp/LTL1622004536546238013.gal : 57 ms
[2023-03-11 09:39:06] [INFO ] Time to serialize properties into /tmp/LTL4970360082193759482.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1622004536546238013.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8446672718695503421.hoa' '-atoms' '/tmp/LTL4970360082193759482.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4970360082193759482.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8446672718695503421.hoa
Detected timeout of ITS tools.
[2023-03-11 09:39:22] [INFO ] Flatten gal took : 74 ms
[2023-03-11 09:39:22] [INFO ] Flatten gal took : 82 ms
[2023-03-11 09:39:22] [INFO ] Time to serialize gal into /tmp/LTL5734357063045653903.gal : 18 ms
[2023-03-11 09:39:22] [INFO ] Time to serialize properties into /tmp/LTL13977077947521437605.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5734357063045653903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13977077947521437605.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(TrainState_22_3_7==1)")||(G("(TrainState_19_1_20==0)"))))))
Formula 0 simplified : XG(!"(TrainState_22_3_7==1)" & F!"(TrainState_19_1_20==0)")
Detected timeout of ITS tools.
[2023-03-11 09:39:37] [INFO ] Flatten gal took : 123 ms
[2023-03-11 09:39:37] [INFO ] Applying decomposition
[2023-03-11 09:39:37] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12819141113268081545.txt' '-o' '/tmp/graph12819141113268081545.bin' '-w' '/tmp/graph12819141113268081545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12819141113268081545.bin' '-l' '-1' '-v' '-w' '/tmp/graph12819141113268081545.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:39:37] [INFO ] Decomposing Gal with order
[2023-03-11 09:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:39:38] [INFO ] Removed a total of 1529 redundant transitions.
[2023-03-11 09:39:38] [INFO ] Flatten gal took : 178 ms
[2023-03-11 09:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 845 labels/synchronizations in 16 ms.
[2023-03-11 09:39:38] [INFO ] Time to serialize gal into /tmp/LTL1593016535888850640.gal : 25 ms
[2023-03-11 09:39:38] [INFO ] Time to serialize properties into /tmp/LTL8352951574644421594.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1593016535888850640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8352951574644421594.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i3.u112.TrainState_22_3_7==1)")||(G("(i29.u204.TrainState_19_1_20==0)"))))))
Formula 0 simplified : XG(!"(i3.u112.TrainState_22_3_7==1)" & F!"(i29.u204.TrainState_19_1_20==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
53 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.856613,38040,1,0,5286,1537,3035,7583,592,3336,14304
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-040-LTLFireability-10 finished in 63400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 8074 edges and 5280 vertex of which 5277 / 5280 are part of one of the 40 SCC in 3 ms
Free SCC test removed 5237 places
Ensure Unique test removed 8035 transitions
Reduce isomorphic transitions removed 8035 transitions.
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 40 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Applied a total of 42 rules in 52 ms. Remains 4 /5280 variables (removed 5276) and now considering 5/8080 (removed 8075) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 09:39:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 09:39:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 09:39:39] [INFO ] Invariant cache hit.
[2023-03-11 09:39:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-11 09:39:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:39:39] [INFO ] Invariant cache hit.
[2023-03-11 09:39:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/5280 places, 5/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 4/5280 places, 5/8080 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-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:(AND (EQ s0 0) (EQ s1 0))], 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 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-11 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(!p0)) U X(G(p1))))'
Support contains 2 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 1684 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2023-03-11 09:39:41] [INFO ] Computed 40 place invariants in 31 ms
[2023-03-11 09:39:41] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-11 09:39:41] [INFO ] Invariant cache hit.
[2023-03-11 09:39:42] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2023-03-11 09:39:42] [INFO ] Invariant cache hit.
[2023-03-11 09:39:44] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4972 ms. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s25 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 7 ms.
FORMULA BART-PT-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-12 finished in 5295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U (p1||(p2&&G((p2 U p3))))))))'
Support contains 4 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1278 places :
Symmetric choice reduction at 0 with 1278 rule applications. Total rules 1278 place count 4002 transition count 6802
Iterating global reduction 0 with 1278 rules applied. Total rules applied 2556 place count 4002 transition count 6802
Discarding 1078 places :
Symmetric choice reduction at 0 with 1078 rule applications. Total rules 3634 place count 2924 transition count 5724
Iterating global reduction 0 with 1078 rules applied. Total rules applied 4712 place count 2924 transition count 5724
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4872 place count 2764 transition count 5564
Iterating global reduction 0 with 160 rules applied. Total rules applied 5032 place count 2764 transition count 5564
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5152 place count 2644 transition count 5444
Iterating global reduction 0 with 120 rules applied. Total rules applied 5272 place count 2644 transition count 5444
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5391 place count 2525 transition count 5325
Iterating global reduction 0 with 119 rules applied. Total rules applied 5510 place count 2525 transition count 5325
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5629 place count 2406 transition count 5206
Iterating global reduction 0 with 119 rules applied. Total rules applied 5748 place count 2406 transition count 5206
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5867 place count 2287 transition count 5087
Iterating global reduction 0 with 119 rules applied. Total rules applied 5986 place count 2287 transition count 5087
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6105 place count 2168 transition count 4968
Iterating global reduction 0 with 119 rules applied. Total rules applied 6224 place count 2168 transition count 4968
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6303 place count 2089 transition count 4889
Iterating global reduction 0 with 79 rules applied. Total rules applied 6382 place count 2089 transition count 4889
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6461 place count 2010 transition count 4810
Iterating global reduction 0 with 79 rules applied. Total rules applied 6540 place count 2010 transition count 4810
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 6579 place count 1971 transition count 4771
Iterating global reduction 0 with 39 rules applied. Total rules applied 6618 place count 1971 transition count 4771
Applied a total of 6618 rules in 1608 ms. Remains 1971 /5280 variables (removed 3309) and now considering 4771/8080 (removed 3309) transitions.
// Phase 1: matrix 4771 rows 1971 cols
[2023-03-11 09:39:46] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-11 09:39:46] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-11 09:39:46] [INFO ] Invariant cache hit.
[2023-03-11 09:39:47] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-11 09:39:47] [INFO ] Invariant cache hit.
[2023-03-11 09:39:51] [INFO ] Dead Transitions using invariants and state equation in 3474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1971/5280 places, 4771/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6266 ms. Remains : 1971/5280 places, 4771/8080 transitions.
Stuttering acceptance computed with spot in 594 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : BART-PT-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) p3 (NOT p0))), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p2 (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s360 1), p2:(EQ s1286 1), p0:(EQ s808 1), p3:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 851 ms.
Product exploration explored 100000 steps with 17 reset in 787 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 710 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 8 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 809 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 09:39:58] [INFO ] Invariant cache hit.
[2023-03-11 09:39:58] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2023-03-11 09:39:59] [INFO ] After 1208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 09:39:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 111 ms returned sat
[2023-03-11 09:40:02] [INFO ] After 2694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 09:40:04] [INFO ] After 4162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 832 ms.
[2023-03-11 09:40:05] [INFO ] After 5854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 198 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=49 )
Parikh walk visited 5 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p1) p2 (NOT p3) (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND p2 (NOT p0)) (AND p3 (NOT p0))))), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 1211 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 8 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 629 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 582 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-11 09:40:07] [INFO ] Invariant cache hit.
[2023-03-11 09:40:09] [INFO ] [Real]Absence check using 40 positive place invariants in 3 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F (AND (NOT p1) p2 (NOT p3) (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND p2 (NOT p0)) (AND p3 (NOT p0))))), (F p0), (F (AND p2 (NOT p3) (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 6 factoid took 646 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-040-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-13 finished in 24877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U (p2||G(!p1)))||p0)))'
Support contains 4 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1278 places :
Symmetric choice reduction at 0 with 1278 rule applications. Total rules 1278 place count 4002 transition count 6802
Iterating global reduction 0 with 1278 rules applied. Total rules applied 2556 place count 4002 transition count 6802
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3635 place count 2923 transition count 5723
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4714 place count 2923 transition count 5723
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 4873 place count 2764 transition count 5564
Iterating global reduction 0 with 159 rules applied. Total rules applied 5032 place count 2764 transition count 5564
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5151 place count 2645 transition count 5445
Iterating global reduction 0 with 119 rules applied. Total rules applied 5270 place count 2645 transition count 5445
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5389 place count 2526 transition count 5326
Iterating global reduction 0 with 119 rules applied. Total rules applied 5508 place count 2526 transition count 5326
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5627 place count 2407 transition count 5207
Iterating global reduction 0 with 119 rules applied. Total rules applied 5746 place count 2407 transition count 5207
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 5865 place count 2288 transition count 5088
Iterating global reduction 0 with 119 rules applied. Total rules applied 5984 place count 2288 transition count 5088
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 6103 place count 2169 transition count 4969
Iterating global reduction 0 with 119 rules applied. Total rules applied 6222 place count 2169 transition count 4969
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6301 place count 2090 transition count 4890
Iterating global reduction 0 with 79 rules applied. Total rules applied 6380 place count 2090 transition count 4890
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 6459 place count 2011 transition count 4811
Iterating global reduction 0 with 79 rules applied. Total rules applied 6538 place count 2011 transition count 4811
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 6577 place count 1972 transition count 4772
Iterating global reduction 0 with 39 rules applied. Total rules applied 6616 place count 1972 transition count 4772
Applied a total of 6616 rules in 2114 ms. Remains 1972 /5280 variables (removed 3308) and now considering 4772/8080 (removed 3308) transitions.
// Phase 1: matrix 4772 rows 1972 cols
[2023-03-11 09:40:11] [INFO ] Computed 40 place invariants in 27 ms
[2023-03-11 09:40:12] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-11 09:40:12] [INFO ] Invariant cache hit.
[2023-03-11 09:40:13] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-11 09:40:13] [INFO ] Invariant cache hit.
[2023-03-11 09:40:15] [INFO ] Dead Transitions using invariants and state equation in 2269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1972/5280 places, 4772/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5551 ms. Remains : 1972/5280 places, 4772/8080 transitions.
Stuttering acceptance computed with spot in 272 ms :[p1, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), true]
Running random walk in product with property : BART-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s1567 1), p2:(EQ s440 1), p0:(OR (EQ s42 1) (EQ s62 0))], 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]]
Product exploration explored 100000 steps with 50000 reset in 4202 ms.
Product exploration explored 100000 steps with 50000 reset in 4160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) p1)))
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-040-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-14 finished in 16487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G((!p1||(p2 U (p3||G(p2)))))))))'
Support contains 4 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Graph (trivial) has 8035 edges and 5280 vertex of which 5127 / 5280 are part of one of the 39 SCC in 6 ms
Free SCC test removed 5088 places
Ensure Unique test removed 7810 transitions
Reduce isomorphic transitions removed 7810 transitions.
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 156 transition count 159
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 190 place count 80 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 193 place count 79 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 196 place count 78 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 200 place count 77 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 203 place count 75 transition count 149
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 203 place count 75 transition count 144
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 213 place count 70 transition count 144
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 219 place count 64 transition count 138
Iterating global reduction 6 with 6 rules applied. Total rules applied 225 place count 64 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 64 transition count 137
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 230 place count 60 transition count 133
Iterating global reduction 7 with 4 rules applied. Total rules applied 234 place count 60 transition count 133
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 237 place count 57 transition count 130
Iterating global reduction 7 with 3 rules applied. Total rules applied 240 place count 57 transition count 130
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 243 place count 54 transition count 127
Iterating global reduction 7 with 3 rules applied. Total rules applied 246 place count 54 transition count 127
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 248 place count 52 transition count 125
Iterating global reduction 7 with 2 rules applied. Total rules applied 250 place count 52 transition count 125
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 252 place count 50 transition count 123
Iterating global reduction 7 with 2 rules applied. Total rules applied 254 place count 50 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 255 place count 49 transition count 122
Iterating global reduction 7 with 1 rules applied. Total rules applied 256 place count 49 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 270 place count 42 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 274 place count 42 transition count 111
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 8 with 4 rules applied. Total rules applied 278 place count 40 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 282 place count 40 transition count 105
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 9 with 4 rules applied. Total rules applied 286 place count 38 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 290 place count 38 transition count 99
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 10 with 4 rules applied. Total rules applied 294 place count 36 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 298 place count 36 transition count 93
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 11 with 4 rules applied. Total rules applied 302 place count 34 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 306 place count 34 transition count 87
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 12 with 4 rules applied. Total rules applied 310 place count 32 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 314 place count 32 transition count 81
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 13 with 4 rules applied. Total rules applied 318 place count 30 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 322 place count 30 transition count 75
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 14 with 4 rules applied. Total rules applied 326 place count 28 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 330 place count 28 transition count 69
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 15 with 4 rules applied. Total rules applied 334 place count 26 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 338 place count 26 transition count 63
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 16 with 4 rules applied. Total rules applied 342 place count 24 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 346 place count 24 transition count 57
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 17 with 4 rules applied. Total rules applied 350 place count 22 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 354 place count 22 transition count 51
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 18 with 4 rules applied. Total rules applied 358 place count 20 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 362 place count 20 transition count 45
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 19 with 4 rules applied. Total rules applied 366 place count 18 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 370 place count 18 transition count 39
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 20 with 4 rules applied. Total rules applied 374 place count 16 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 378 place count 16 transition count 33
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 21 with 4 rules applied. Total rules applied 382 place count 14 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 386 place count 14 transition count 27
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 22 with 4 rules applied. Total rules applied 390 place count 12 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 394 place count 12 transition count 21
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 23 with 4 rules applied. Total rules applied 398 place count 10 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 23 with 5 rules applied. Total rules applied 403 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 405 place count 9 transition count 13
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 25 with 3 rules applied. Total rules applied 408 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 25 with 1 Pre rules applied. Total rules applied 408 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 410 place count 8 transition count 9
Applied a total of 410 rules in 48 ms. Remains 8 /5280 variables (removed 5272) and now considering 9/8080 (removed 8071) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-03-11 09:40:26] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 09:40:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 09:40:26] [INFO ] Invariant cache hit.
[2023-03-11 09:40:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-11 09:40:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:40:26] [INFO ] Invariant cache hit.
[2023-03-11 09:40:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/5280 places, 9/8080 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 8/5280 places, 9/8080 transitions.
Stuttering acceptance computed with spot in 405 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) p1)]
Running random walk in product with property : BART-PT-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND p3 p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND p3 p0)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND p3 p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(OR (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(NEQ s2 1), p1:(AND (EQ s0 1) (EQ s4 1)), p3:(AND (NEQ s3 1) (EQ s0 1)), p2:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-15 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&((p0 U p2)||p1)))))'
Found a Shortening insensitive property : BART-PT-040-LTLFireability-07
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3560 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 5280 transition count 8000
Reduce places removed 80 places and 0 transitions.
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Iterating post reduction 1 with 440 rules applied. Total rules applied 520 place count 5200 transition count 7640
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 2 with 360 rules applied. Total rules applied 880 place count 4840 transition count 7640
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 880 place count 4840 transition count 7480
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1200 place count 4680 transition count 7480
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1440 place count 4440 transition count 7240
Iterating global reduction 3 with 240 rules applied. Total rules applied 1680 place count 4440 transition count 7240
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1720 place count 4440 transition count 7200
Discarding 120 places :
Symmetric choice reduction at 4 with 120 rule applications. Total rules 1840 place count 4320 transition count 7080
Iterating global reduction 4 with 120 rules applied. Total rules applied 1960 place count 4320 transition count 7080
Discarding 120 places :
Symmetric choice reduction at 4 with 120 rule applications. Total rules 2080 place count 4200 transition count 6960
Iterating global reduction 4 with 120 rules applied. Total rules applied 2200 place count 4200 transition count 6960
Discarding 120 places :
Symmetric choice reduction at 4 with 120 rule applications. Total rules 2320 place count 4080 transition count 6840
Iterating global reduction 4 with 120 rules applied. Total rules applied 2440 place count 4080 transition count 6840
Discarding 80 places :
Symmetric choice reduction at 4 with 80 rule applications. Total rules 2520 place count 4000 transition count 6760
Iterating global reduction 4 with 80 rules applied. Total rules applied 2600 place count 4000 transition count 6760
Discarding 80 places :
Symmetric choice reduction at 4 with 80 rule applications. Total rules 2680 place count 3920 transition count 6680
Iterating global reduction 4 with 80 rules applied. Total rules applied 2760 place count 3920 transition count 6680
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 2800 place count 3880 transition count 6640
Iterating global reduction 4 with 40 rules applied. Total rules applied 2840 place count 3880 transition count 6640
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 4 with 480 rules applied. Total rules applied 3320 place count 3640 transition count 6400
Applied a total of 3320 rules in 753 ms. Remains 3640 /5280 variables (removed 1640) and now considering 6400/8080 (removed 1680) transitions.
// Phase 1: matrix 6400 rows 3640 cols
[2023-03-11 09:40:28] [INFO ] Computed 40 place invariants in 44 ms
[2023-03-11 09:40:28] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-11 09:40:28] [INFO ] Invariant cache hit.
[2023-03-11 09:40:29] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
[2023-03-11 09:40:29] [INFO ] Invariant cache hit.
[2023-03-11 09:40:34] [INFO ] Dead Transitions using invariants and state equation in 4963 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3640/5280 places, 6400/8080 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7277 ms. Remains : 3640/5280 places, 6400/8080 transitions.
Running random walk in product with property : BART-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s378 1) (EQ s2869 1) (EQ s2519 1) (EQ s3592 1) (EQ s3122 1) (EQ s3496 1) (EQ s454 1) (EQ s3036 1) (EQ s1840 1) (EQ s920 1) (EQ s505 1) (EQ s125...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 2130 ms.
Product exploration explored 100000 steps with 0 reset in 2189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 607 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 872 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:41:56] [INFO ] Invariant cache hit.
[2023-03-11 09:41:58] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 601 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-11 09:42:10] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-11 09:42:26] [INFO ] Invariant cache hit.
[2023-03-11 09:42:29] [INFO ] [Real]Absence check using 40 positive place invariants in 48 ms returned sat
[2023-03-11 09:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:42:33] [INFO ] [Real]Absence check using state equation in 3472 ms returned sat
[2023-03-11 09:42:34] [INFO ] Computed and/alt/rep : 4920/7600/4920 causal constraints (skipped 40 transitions) in 427 ms.
[2023-03-11 09:42:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:42:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 65 ms returned sat
[2023-03-11 09:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:42:42] [INFO ] [Nat]Absence check using state equation in 3572 ms returned sat
[2023-03-11 09:42:43] [INFO ] Computed and/alt/rep : 4920/7600/4920 causal constraints (skipped 40 transitions) in 479 ms.
[2023-03-11 09:42:53] [INFO ] Deduced a trap composed of 91 places in 3548 ms of which 19 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 09:42:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 3560 out of 3640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3640/3640 places, 6400/6400 transitions.
Applied a total of 0 rules in 23 ms. Remains 3640 /3640 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2023-03-11 09:42:53] [INFO ] Invariant cache hit.
[2023-03-11 09:42:54] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-11 09:42:54] [INFO ] Invariant cache hit.
[2023-03-11 09:42:55] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2023-03-11 09:42:55] [INFO ] Invariant cache hit.
[2023-03-11 09:43:00] [INFO ] Dead Transitions using invariants and state equation in 5157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7113 ms. Remains : 3640/3640 places, 6400/6400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 1 factoid took 487 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 570 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-11 09:43:15] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-11 09:43:30] [INFO ] Invariant cache hit.
[2023-03-11 09:43:34] [INFO ] [Real]Absence check using 40 positive place invariants in 45 ms returned sat
[2023-03-11 09:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:43:37] [INFO ] [Real]Absence check using state equation in 2820 ms returned sat
[2023-03-11 09:43:37] [INFO ] Computed and/alt/rep : 4920/7600/4920 causal constraints (skipped 40 transitions) in 369 ms.
[2023-03-11 09:43:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:43:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 43 ms returned sat
[2023-03-11 09:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:43:45] [INFO ] [Nat]Absence check using state equation in 2801 ms returned sat
[2023-03-11 09:43:46] [INFO ] Computed and/alt/rep : 4920/7600/4920 causal constraints (skipped 40 transitions) in 392 ms.
[2023-03-11 09:43:57] [INFO ] Deduced a trap composed of 91 places in 3425 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 09:43:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 2219 ms.
Product exploration explored 100000 steps with 2 reset in 2410 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 3560 out of 3640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3640/3640 places, 6400/6400 transitions.
Applied a total of 0 rules in 54 ms. Remains 3640 /3640 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2023-03-11 09:44:03] [INFO ] Redundant transitions in 585 ms returned []
[2023-03-11 09:44:03] [INFO ] Invariant cache hit.
[2023-03-11 09:44:08] [INFO ] Dead Transitions using invariants and state equation in 5268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5921 ms. Remains : 3640/3640 places, 6400/6400 transitions.
Built C files in :
/tmp/ltsmin13231031797647814276
[2023-03-11 09:44:08] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13231031797647814276
Running compilation step : cd /tmp/ltsmin13231031797647814276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13231031797647814276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13231031797647814276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3560 out of 3640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3640/3640 places, 6400/6400 transitions.
Applied a total of 0 rules in 26 ms. Remains 3640 /3640 variables (removed 0) and now considering 6400/6400 (removed 0) transitions.
[2023-03-11 09:44:11] [INFO ] Invariant cache hit.
[2023-03-11 09:44:12] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-11 09:44:12] [INFO ] Invariant cache hit.
[2023-03-11 09:44:13] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-11 09:44:13] [INFO ] Invariant cache hit.
[2023-03-11 09:44:17] [INFO ] Dead Transitions using invariants and state equation in 4358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6188 ms. Remains : 3640/3640 places, 6400/6400 transitions.
Built C files in :
/tmp/ltsmin1350766209610800995
[2023-03-11 09:44:18] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1350766209610800995
Running compilation step : cd /tmp/ltsmin1350766209610800995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1350766209610800995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1350766209610800995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 09:44:21] [INFO ] Flatten gal took : 112 ms
[2023-03-11 09:44:21] [INFO ] Flatten gal took : 116 ms
[2023-03-11 09:44:21] [INFO ] Time to serialize gal into /tmp/LTL13170580199824174652.gal : 21 ms
[2023-03-11 09:44:21] [INFO ] Time to serialize properties into /tmp/LTL13287761626402573355.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13170580199824174652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18271619708116513840.hoa' '-atoms' '/tmp/LTL13287761626402573355.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13287761626402573355.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18271619708116513840.hoa
Detected timeout of ITS tools.
[2023-03-11 09:44:37] [INFO ] Flatten gal took : 147 ms
[2023-03-11 09:44:37] [INFO ] Flatten gal took : 163 ms
[2023-03-11 09:44:37] [INFO ] Time to serialize gal into /tmp/LTL12831423790236350261.gal : 24 ms
[2023-03-11 09:44:37] [INFO ] Time to serialize properties into /tmp/LTL5764047779355717967.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12831423790236350261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5764047779355717967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((((((TrainState_19_1_11==1)||(TrainState_30_1_33==1))||((TrainState_40_1_30==1)||(TrainState_33_2_39==1)))||(((Trai...190286
Formula 0 simplified : XG(F!"(((((((((((((TrainState_19_1_11==1)||(TrainState_30_1_33==1))||((TrainState_40_1_30==1)||(TrainState_33_2_39==1)))||(((TrainSt...190277
Detected timeout of ITS tools.
[2023-03-11 09:44:52] [INFO ] Flatten gal took : 191 ms
[2023-03-11 09:44:52] [INFO ] Applying decomposition
[2023-03-11 09:44:52] [INFO ] Flatten gal took : 153 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10998098161189759075.txt' '-o' '/tmp/graph10998098161189759075.bin' '-w' '/tmp/graph10998098161189759075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10998098161189759075.bin' '-l' '-1' '-v' '-w' '/tmp/graph10998098161189759075.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:44:53] [INFO ] Decomposing Gal with order
[2023-03-11 09:44:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:44:53] [INFO ] Removed a total of 911 redundant transitions.
[2023-03-11 09:44:54] [INFO ] Flatten gal took : 279 ms
[2023-03-11 09:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 10 ms.
[2023-03-11 09:44:54] [INFO ] Time to serialize gal into /tmp/LTL11591871361195102915.gal : 25 ms
[2023-03-11 09:44:54] [INFO ] Time to serialize properties into /tmp/LTL17299088578813966942.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11591871361195102915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17299088578813966942.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((((((i4.u7.TrainState_19_1_11==1)||(i25.u30.TrainState_30_1_33==1))||((i28.u33.TrainState_40_1_30==1)||(i26.u957.Tr...248186
Formula 0 simplified : XG(F!"(((((((((((((i4.u7.TrainState_19_1_11==1)||(i25.u30.TrainState_30_1_33==1))||((i28.u33.TrainState_40_1_30==1)||(i26.u957.Train...248177
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
548 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.04334,137512,1,0,226033,7927,19338,260524,2903,22955,299521
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property BART-PT-040-LTLFireability-07 finished in 274561 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-11 09:45:01] [INFO ] Flatten gal took : 163 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15987594859532748589
[2023-03-11 09:45:01] [INFO ] Too many transitions (8080) to apply POR reductions. Disabling POR matrices.
[2023-03-11 09:45:01] [INFO ] Applying decomposition
[2023-03-11 09:45:01] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15987594859532748589
Running compilation step : cd /tmp/ltsmin15987594859532748589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 09:45:02] [INFO ] Flatten gal took : 182 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17794005946447231551.txt' '-o' '/tmp/graph17794005946447231551.bin' '-w' '/tmp/graph17794005946447231551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17794005946447231551.bin' '-l' '-1' '-v' '-w' '/tmp/graph17794005946447231551.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:45:02] [INFO ] Decomposing Gal with order
[2023-03-11 09:45:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:45:04] [INFO ] Removed a total of 539 redundant transitions.
[2023-03-11 09:45:04] [INFO ] Flatten gal took : 321 ms
[2023-03-11 09:45:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-11 09:45:09] [INFO ] Time to serialize gal into /tmp/LTLFireability15146168577460315208.gal : 44 ms
[2023-03-11 09:45:09] [INFO ] Time to serialize properties into /tmp/LTLFireability1220875766572569770.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15146168577460315208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1220875766572569770.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((((((i19.i0.u808.TrainState_19_1_11==1)||(i28.i0.u106.TrainState_30_1_33==1))||((i15.i0.u109.TrainState_40_1_30==1)...275496
Formula 0 simplified : XG(F!"(((((((((((((i19.i0.u808.TrainState_19_1_11==1)||(i28.i0.u106.TrainState_30_1_33==1))||((i15.i0.u109.TrainState_40_1_30==1)||(...275487
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 43198 ms.
Running link step : cd /tmp/ltsmin15987594859532748589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 167 ms.
Running LTSmin : cd /tmp/ltsmin15987594859532748589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(((LTLAPp0==true) U (LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3635 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,37.1797,565024,1,0,911252,9212,35040,2.47267e+06,2020,22167,1499670
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-040-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1078320 ms.

BK_STOP 1678527962382

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BART-PT-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593600796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-040.tgz
mv BART-PT-040 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;