About the Execution of ITS-Tools for CircularTrains-PT-096
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 326.355 | 26697.00 | 42205.00 | 247.30 | FFTTTTFFTFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918900739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CircularTrains-PT-096, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918900739
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 07:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 73K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-096-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652682253715
Running Version 202205111006
[2022-05-16 06:24:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 06:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:24:15] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-16 06:24:15] [INFO ] Transformed 192 places.
[2022-05-16 06:24:15] [INFO ] Transformed 96 transitions.
[2022-05-16 06:24:15] [INFO ] Parsed PT model containing 192 places and 96 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-096-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 30 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2022-05-16 06:24:15] [INFO ] Computed 97 place invariants in 23 ms
[2022-05-16 06:24:15] [INFO ] Implicit Places using invariants in 282 ms returned [1, 4, 5, 8, 10, 14, 27, 37, 49, 109, 123, 144, 155, 164, 166, 177, 178, 183, 185, 186, 187, 189]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 311 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 96/96 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/192 places, 96/96 transitions.
Support contains 34 out of 170 places after structural reductions.
[2022-05-16 06:24:15] [INFO ] Flatten gal took : 38 ms
[2022-05-16 06:24:15] [INFO ] Flatten gal took : 16 ms
[2022-05-16 06:24:15] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 31 out of 170 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 170 cols
[2022-05-16 06:24:16] [INFO ] Computed 75 place invariants in 5 ms
[2022-05-16 06:24:16] [INFO ] [Real]Absence check using 61 positive place invariants in 9 ms returned sat
[2022-05-16 06:24:16] [INFO ] [Real]Absence check using 61 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 06:24:16] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
FORMULA CircularTrains-PT-096-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(G(p0)))))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 170 cols
[2022-05-16 06:24:16] [INFO ] Computed 75 place invariants in 4 ms
[2022-05-16 06:24:16] [INFO ] Implicit Places using invariants in 163 ms returned [14, 22, 31, 105, 106, 114, 149, 153, 159, 165]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 165 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/170 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/170 places, 96/96 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s81 s47)], 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 36 steps with 0 reset in 6 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLCardinality-01 finished in 480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U X(X(p1))))'
Support contains 7 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 170 cols
[2022-05-16 06:24:17] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-16 06:24:17] [INFO ] Implicit Places using invariants in 111 ms returned [14, 22, 31, 106, 114, 149, 153, 159, 165]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 112 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/170 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/170 places, 96/96 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (AND (LEQ s5 s113) (LEQ s66 s117)) (LEQ s152 s100)), p1:(OR (LEQ s5 s113) (LEQ 3 s102))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12011 steps with 3981 reset in 116 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLCardinality-06 finished in 548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G((false U false))||p0)))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 170 transition count 80
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 154 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 32 place count 154 transition count 74
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 148 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 142 transition count 68
Applied a total of 56 rules in 24 ms. Remains 142 /170 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 142 cols
[2022-05-16 06:24:17] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 06:24:17] [INFO ] Implicit Places using invariants in 84 ms returned [10, 18, 25, 90, 91, 98, 126, 129]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/170 places, 68/96 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 134 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 130 transition count 64
Applied a total of 8 rules in 7 ms. Remains 130 /134 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 130 cols
[2022-05-16 06:24:17] [INFO ] Computed 67 place invariants in 1 ms
[2022-05-16 06:24:17] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 64 rows 130 cols
[2022-05-16 06:24:17] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 06:24:17] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/170 places, 64/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 130/170 places, 64/96 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-07 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:(LEQ s121 s126)], 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 1392 reset in 471 ms.
Product exploration explored 100000 steps with 1395 reset in 528 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 130 cols
[2022-05-16 06:24:19] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 06:24:19] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 64 rows 130 cols
[2022-05-16 06:24:19] [INFO ] Computed 67 place invariants in 2 ms
[2022-05-16 06:24:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2022-05-16 06:24:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 130 cols
[2022-05-16 06:24:19] [INFO ] Computed 67 place invariants in 1 ms
[2022-05-16 06:24:19] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 64/64 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1387 reset in 389 ms.
Product exploration explored 100000 steps with 1452 reset in 411 ms.
Built C files in :
/tmp/ltsmin3309484366825700438
[2022-05-16 06:24:21] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-16 06:24:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:21] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-16 06:24:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:21] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-16 06:24:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3309484366825700438
Running compilation step : cd /tmp/ltsmin3309484366825700438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin3309484366825700438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3309484366825700438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3856502506303125374.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLCardinality-07 finished in 4146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((F(p0) U (G(p1)&&!p0)))) U p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 170 transition count 81
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 155 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 154 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 154 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 148 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 56 place count 142 transition count 68
Applied a total of 56 rules in 17 ms. Remains 142 /170 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 142 cols
[2022-05-16 06:24:21] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 06:24:21] [INFO ] Implicit Places using invariants in 98 ms returned [10, 18, 25, 90, 91, 126, 129, 133, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 99 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/170 places, 68/96 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 65
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 130 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 130 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 129 transition count 64
Applied a total of 8 rules in 6 ms. Remains 129 /133 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:21] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:22] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:22] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-16 06:24:22] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/170 places, 64/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 129/170 places, 64/96 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=6 dest: 4}, { cond=p1, acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s91), p1:(LEQ 1 s84)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 487 reset in 401 ms.
Product exploration explored 100000 steps with 501 reset in 430 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 506 ms. Reduced automaton from 7 states, 24 edges and 2 AP to 7 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 713 ms. Reduced automaton from 7 states, 24 edges and 2 AP to 7 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:25] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-16 06:24:25] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:25] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:25] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-16 06:24:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:25] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 64/64 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 495 ms. Reduced automaton from 7 states, 24 edges and 2 AP to 7 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (OR p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 610 ms. Reduced automaton from 7 states, 24 edges and 2 AP to 7 states, 24 edges and 2 AP.
Stuttering acceptance computed with spot in 402 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (OR (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 498 reset in 393 ms.
Product exploration explored 100000 steps with 522 reset in 450 ms.
Built C files in :
/tmp/ltsmin8975716716425975679
[2022-05-16 06:24:28] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-16 06:24:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:28] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-16 06:24:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:28] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-16 06:24:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:28] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8975716716425975679
Running compilation step : cd /tmp/ltsmin8975716716425975679;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin8975716716425975679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8975716716425975679;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2511508908588866191.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLCardinality-09 finished in 7491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 170 transition count 81
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 155 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 154 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 154 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 148 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 54 place count 143 transition count 69
Applied a total of 54 rules in 25 ms. Remains 143 /170 variables (removed 27) and now considering 69/96 (removed 27) transitions.
// Phase 1: matrix 69 rows 143 cols
[2022-05-16 06:24:29] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-16 06:24:29] [INFO ] Implicit Places using invariants in 90 ms returned [10, 25, 91, 92, 99, 127, 130, 134, 139]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 91 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/170 places, 69/96 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 134 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 130 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 130 transition count 64
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 129 transition count 64
Applied a total of 10 rules in 7 ms. Remains 129 /134 variables (removed 5) and now considering 64/69 (removed 5) transitions.
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:29] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:24:29] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:29] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:24:29] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/170 places, 64/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 129/170 places, 64/96 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GT s57 s17), p0:(AND (LEQ 1 s128) (LEQ s57 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 744 reset in 376 ms.
Product exploration explored 100000 steps with 769 reset in 409 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))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 1 factoid took 281 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:31] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:31] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned sat
[2022-05-16 06:24:31] [INFO ] [Real]Absence check using 64 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:24:31] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-16 06:24:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:24:31] [INFO ] [Nat]Absence check using 64 positive place invariants in 10 ms returned sat
[2022-05-16 06:24:31] [INFO ] [Nat]Absence check using 64 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 06:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:24:31] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 06:24:31] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 06:24:31] [INFO ] Added : 31 causal constraints over 7 iterations in 110 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:31] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:24:31] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:31] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:31] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-16 06:24:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:31] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:24:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 64/64 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 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:32] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:32] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned sat
[2022-05-16 06:24:32] [INFO ] [Real]Absence check using 64 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 06:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:24:32] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-16 06:24:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:24:32] [INFO ] [Nat]Absence check using 64 positive place invariants in 9 ms returned sat
[2022-05-16 06:24:32] [INFO ] [Nat]Absence check using 64 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:24:32] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-16 06:24:32] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 06:24:32] [INFO ] Added : 31 causal constraints over 7 iterations in 102 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 90 ms :[(NOT p1)]
Product exploration explored 100000 steps with 773 reset in 393 ms.
Product exploration explored 100000 steps with 743 reset in 413 ms.
Built C files in :
/tmp/ltsmin608366639925850175
[2022-05-16 06:24:33] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-16 06:24:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:33] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-16 06:24:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:33] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-16 06:24:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:33] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin608366639925850175
Running compilation step : cd /tmp/ltsmin608366639925850175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin608366639925850175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin608366639925850175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11067778325001100475.hoa' '--buchi-type=spotba'
LTSmin run took 324 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLCardinality-11 finished in 4600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 170 transition count 82
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 156 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 154 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 154 transition count 74
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 148 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 56 place count 142 transition count 68
Applied a total of 56 rules in 14 ms. Remains 142 /170 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 142 cols
[2022-05-16 06:24:33] [INFO ] Computed 75 place invariants in 0 ms
[2022-05-16 06:24:34] [INFO ] Implicit Places using invariants in 87 ms returned [10, 18, 25, 90, 91, 98, 126, 129, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 88 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/170 places, 68/96 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 129 transition count 64
Applied a total of 8 rules in 6 ms. Remains 129 /133 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:34] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:34] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:34] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:34] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/170 places, 64/96 transitions.
Finished structural reductions, in 2 iterations. Remains : 129/170 places, 64/96 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s63 s37), p1:(LEQ 1 s121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 148 reset in 364 ms.
Product exploration explored 100000 steps with 150 reset in 397 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 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 254 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 280 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 358 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:36] [INFO ] Computed 66 place invariants in 2 ms
[2022-05-16 06:24:36] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:36] [INFO ] Computed 66 place invariants in 0 ms
[2022-05-16 06:24:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-05-16 06:24:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 129 cols
[2022-05-16 06:24:36] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-16 06:24:36] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 64/64 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 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 360 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 136 reset in 364 ms.
Product exploration explored 100000 steps with 141 reset in 404 ms.
Built C files in :
/tmp/ltsmin6955577700624100846
[2022-05-16 06:24:38] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-16 06:24:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:38] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-16 06:24:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:38] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-16 06:24:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:24:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6955577700624100846
Running compilation step : cd /tmp/ltsmin6955577700624100846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin6955577700624100846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6955577700624100846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12364601386289865927.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA CircularTrains-PT-096-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLCardinality-13 finished in 4622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(F(G(p1))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 170 cols
[2022-05-16 06:24:38] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-16 06:24:38] [INFO ] Implicit Places using invariants in 99 ms returned [14, 22, 105, 106, 114, 149, 159, 165]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 100 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/170 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 162/170 places, 96/96 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s109 s147), p1:(GT s142 s29)], 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 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 486 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 p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
// Phase 1: matrix 96 rows 162 cols
[2022-05-16 06:24:40] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 06:24:40] [INFO ] [Real]Absence check using 62 positive place invariants in 11 ms returned sat
[2022-05-16 06:24:40] [INFO ] [Real]Absence check using 62 positive and 5 generalized place invariants in 4 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA CircularTrains-PT-096-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-096-LTLCardinality-14 finished in 1765 ms.
All properties solved by simple procedures.
Total runtime 25372 ms.
BK_STOP 1652682280412
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-096"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-096, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918900739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-096.tgz
mv CircularTrains-PT-096 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;