About the Execution of ITS-Tools for CSRepetitions-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2651.808 | 368979.00 | 991830.00 | 3592.90 | TTFFFFTFTTFFFTFF | 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-165251918800612.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 CSRepetitions-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800612
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.4K Apr 30 06:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 06:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 06:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 06:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 18K 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 CSRepetitions-COL-10-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652668203721
Running Version 202205111006
[2022-05-16 02:30:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 02:30:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:30:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 02:30:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:30:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 519 ms
[2022-05-16 02:30:05] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 1311 PT places and 2300.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:30:05] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2022-05-16 02:30:05] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA CSRepetitions-COL-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 113 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=10 )
[2022-05-16 02:30:05] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:30:05] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 10
[2022-05-16 02:30:05] [INFO ] Unfolded HLPN to a Petri net with 402 places and 500 transitions 1500 arcs in 22 ms.
[2022-05-16 02:30:05] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 402 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:05] [INFO ] Computed 101 place invariants in 30 ms
[2022-05-16 02:30:06] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:06] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-16 02:30:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:30:06] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:06] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-16 02:30:06] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Support contains 402 out of 402 places after structural reductions.
[2022-05-16 02:30:06] [INFO ] Flatten gal took : 51 ms
[2022-05-16 02:30:06] [INFO ] Flatten gal took : 58 ms
[2022-05-16 02:30:07] [INFO ] Input system was already deterministic with 500 transitions.
Finished random walk after 150 steps, including 0 resets, run visited all 9 properties in 16 ms. (steps per millisecond=9 )
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' '!(X(((F(p0)||(G(p0)&&p0)) U !X(X(!X(p0))))))'
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 29 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:07] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:30:07] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:07] [INFO ] Computed 101 place invariants in 7 ms
[2022-05-16 02:30:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:30:07] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:07] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-16 02:30:08] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (GEQ s261 1) (GEQ s257 1) (GEQ s269 1) (GEQ s265 1) (GEQ s204 1) (GEQ s277 1) (GEQ s208 1) (GEQ s273 1) (GEQ s212 1) (GEQ s285 1) (GEQ s216 1) (GEQ...], 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 20000 reset in 731 ms.
Product exploration explored 100000 steps with 20000 reset in 676 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:10] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-16 02:30:10] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:10] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-16 02:30:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:30:11] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:11] [INFO ] Computed 101 place invariants in 8 ms
[2022-05-16 02:30:11] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 646 ms.
Product exploration explored 100000 steps with 20000 reset in 635 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 37 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2022-05-16 02:30:14] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:14] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:30:14] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Product exploration explored 100000 steps with 20000 reset in 1293 ms.
Product exploration explored 100000 steps with 20000 reset in 1324 ms.
Built C files in :
/tmp/ltsmin2509298910612487285
[2022-05-16 02:30:16] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2509298910612487285
Running compilation step : cd /tmp/ltsmin2509298910612487285;'/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 1145 ms.
Running link step : cd /tmp/ltsmin2509298910612487285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2509298910612487285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15094956755430828225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:32] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:30:32] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:32] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:30:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:30:32] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:30:32] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-16 02:30:32] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin16289032391351246733
[2022-05-16 02:30:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16289032391351246733
Running compilation step : cd /tmp/ltsmin16289032391351246733;'/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 741 ms.
Running link step : cd /tmp/ltsmin16289032391351246733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16289032391351246733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16949628089183835023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:30:49] [INFO ] Flatten gal took : 25 ms
[2022-05-16 02:30:49] [INFO ] Flatten gal took : 25 ms
[2022-05-16 02:30:49] [INFO ] Time to serialize gal into /tmp/LTL11329985073685818190.gal : 3 ms
[2022-05-16 02:30:50] [INFO ] Time to serialize properties into /tmp/LTL5178775319847207515.ltl : 634 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11329985073685818190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5178775319847207515.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1132998...267
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((((Client_Waiting_59>=1)||(Client_Waiting_55>=1))||((Client_Waiting_67>=1)||(Client_Waiting_63>=1)))||(((Client_Waiting...10419
Formula 0 simplified : !X((F"((((((((Client_Waiting_59>=1)||(Client_Waiting_55>=1))||((Client_Waiting_67>=1)||(Client_Waiting_63>=1)))||(((Client_Waiting_2...10399
Detected timeout of ITS tools.
[2022-05-16 02:31:05] [INFO ] Flatten gal took : 24 ms
[2022-05-16 02:31:05] [INFO ] Applying decomposition
[2022-05-16 02:31:05] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9233679162687092078.txt' '-o' '/tmp/graph9233679162687092078.bin' '-w' '/tmp/graph9233679162687092078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9233679162687092078.bin' '-l' '-1' '-v' '-w' '/tmp/graph9233679162687092078.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:31:05] [INFO ] Decomposing Gal with order
[2022-05-16 02:31:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:31:05] [INFO ] Removed a total of 296 redundant transitions.
[2022-05-16 02:31:05] [INFO ] Flatten gal took : 87 ms
[2022-05-16 02:31:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 02:31:05] [INFO ] Time to serialize gal into /tmp/LTL6909035615566694610.gal : 6 ms
[2022-05-16 02:31:05] [INFO ] Time to serialize properties into /tmp/LTL10315237135201592679.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6909035615566694610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10315237135201592679.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6909035...246
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((((u31.Client_Waiting_59>=1)||(u28.Client_Waiting_55>=1))||((u35.Client_Waiting_67>=1)||(u79.Client_Waiting_63>=1)))||(...11991
Formula 0 simplified : !X((F"((((((((u31.Client_Waiting_59>=1)||(u28.Client_Waiting_55>=1))||((u35.Client_Waiting_67>=1)||(u79.Client_Waiting_63>=1)))||(((...11971
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10809972901671685838
[2022-05-16 02:31:20] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10809972901671685838
Running compilation step : cd /tmp/ltsmin10809972901671685838;'/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 705 ms.
Running link step : cd /tmp/ltsmin10809972901671685838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10809972901671685838;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))||([]((LTLAPp0==true))&&(LTLAPp0==true))) U !X(X(!X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-10-LTLFireability-00 finished in 88570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(G(F(p0))) U (G(p2)||p1))))'
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:35] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:35] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:36] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:31:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:36] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:36] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-16 02:31:36] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 476 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s261 1) (GEQ s257 1) (GEQ s269 1) (GEQ s265 1) (GEQ s204 1) (GEQ s277 1) (GEQ s208 1) (GEQ s273 1) (GEQ s212 1) (GEQ s285 1) (GEQ s216 1) (GEQ...], 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 50000 reset in 631 ms.
Product exploration explored 100000 steps with 50000 reset in 671 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 p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p2) p0)
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLFireability-01 finished in 2833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(F(p0)) U G(!p1)))||X(p2)))'
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:38] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:38] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:38] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:31:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:39] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:39] [INFO ] Computed 101 place invariants in 13 ms
[2022-05-16 02:31:39] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), p1]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (GEQ s261 1) (GEQ s257 1) (GEQ s269 1) (GEQ s265 1) (GEQ s204 1) (GEQ s277 1) (GEQ s208 1) (GEQ s273 1) (GEQ s212 1) (GEQ s285 1) (GEQ s216 1)...], 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 6097 reset in 1516 ms.
Product exploration explored 100000 steps with 6174 reset in 1595 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) p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p2)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 686 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[p1, (NOT p0), p1]
Finished random walk after 122 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p2)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 103 ms :[p1, (NOT p0), p1]
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:43] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:44] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:44] [INFO ] Computed 101 place invariants in 8 ms
[2022-05-16 02:31:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:44] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:44] [INFO ] Computed 101 place invariants in 8 ms
[2022-05-16 02:31:44] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 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 (NOT p1)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[p1, (NOT p0), p1]
Finished random walk after 148 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 99 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 106 ms :[p1, (NOT p0), p1]
Product exploration explored 100000 steps with 6128 reset in 1521 ms.
Product exploration explored 100000 steps with 6040 reset in 1544 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 82 ms :[p1, (NOT p0), p1]
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2022-05-16 02:31:48] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:48] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:48] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Product exploration explored 100000 steps with 6139 reset in 1709 ms.
Product exploration explored 100000 steps with 6140 reset in 1745 ms.
Built C files in :
/tmp/ltsmin11760151973567688694
[2022-05-16 02:31:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11760151973567688694
Running compilation step : cd /tmp/ltsmin11760151973567688694;'/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 879 ms.
Running link step : cd /tmp/ltsmin11760151973567688694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11760151973567688694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1413633195354838821.hoa' '--buchi-type=spotba'
LTSmin run took 674 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-10-LTLFireability-02 finished in 15376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 200 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:54] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:54] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:54] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:31:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:54] [INFO ] Computed 101 place invariants in 7 ms
[2022-05-16 02:31:54] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-03 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: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s44 1) (GEQ s345 1)) (AND (GEQ s49 1) (GEQ s350 1)) (AND (GEQ s39 1) (GEQ s340 1)) (AND (GEQ s34 1) (GEQ s335 1)) (AND (GEQ s54 1) (GEQ 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLFireability-03 finished in 603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((G(p0)&&(p1 U p0))))||(G(p1) U p1)))'
Support contains 301 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:54] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:54] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:54] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-16 02:31:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:54] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-05-16 02:31:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:54] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:55] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s170 1) (GEQ s201 1)) (AND (GEQ s121 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s201 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s190 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 7 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLFireability-05 finished in 579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:55] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-16 02:31:55] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:55] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:55] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:55] [INFO ] Computed 101 place invariants in 7 ms
[2022-05-16 02:31:55] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s147 1) (GEQ s151 1) (GEQ s155 1) (GEQ s159 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7074 reset in 852 ms.
Product exploration explored 100000 steps with 7010 reset in 899 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 341 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:58] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:31:58] [INFO ] [Real]Absence check using 101 positive place invariants in 17 ms returned sat
[2022-05-16 02:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:31:58] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-16 02:31:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:31:59] [INFO ] [Nat]Absence check using 101 positive place invariants in 18 ms returned sat
[2022-05-16 02:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:31:59] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-16 02:31:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:31:59] [INFO ] [Nat]Added 100 Read/Feed constraints in 19 ms returned sat
[2022-05-16 02:31:59] [INFO ] Computed and/alt/rep : 400/500/400 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 02:31:59] [INFO ] Added : 0 causal constraints over 0 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:59] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-16 02:31:59] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:31:59] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:31:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:32:00] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:32:00] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-16 02:32:00] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:32:00] [INFO ] Computed 101 place invariants in 8 ms
[2022-05-16 02:32:01] [INFO ] [Real]Absence check using 101 positive place invariants in 16 ms returned sat
[2022-05-16 02:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:32:01] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-16 02:32:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:32:01] [INFO ] [Nat]Absence check using 101 positive place invariants in 16 ms returned sat
[2022-05-16 02:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:32:01] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-16 02:32:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:32:01] [INFO ] [Nat]Added 100 Read/Feed constraints in 17 ms returned sat
[2022-05-16 02:32:01] [INFO ] Computed and/alt/rep : 400/500/400 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-16 02:32:01] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7030 reset in 845 ms.
Product exploration explored 100000 steps with 7058 reset in 919 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 17 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2022-05-16 02:32:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:32:03] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:32:03] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Product exploration explored 100000 steps with 7085 reset in 1110 ms.
Product exploration explored 100000 steps with 7095 reset in 1160 ms.
Built C files in :
/tmp/ltsmin15206832332349359004
[2022-05-16 02:32:06] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15206832332349359004
Running compilation step : cd /tmp/ltsmin15206832332349359004;'/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 706 ms.
Running link step : cd /tmp/ltsmin15206832332349359004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15206832332349359004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16472482035555612584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:32:21] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:32:21] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:32:21] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:32:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:32:21] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:32:21] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:32:22] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin15867877604309229451
[2022-05-16 02:32:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15867877604309229451
Running compilation step : cd /tmp/ltsmin15867877604309229451;'/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 685 ms.
Running link step : cd /tmp/ltsmin15867877604309229451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15867877604309229451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1972869855075026093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:32:37] [INFO ] Flatten gal took : 25 ms
[2022-05-16 02:32:37] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:32:37] [INFO ] Time to serialize gal into /tmp/LTL14327285912902355438.gal : 3 ms
[2022-05-16 02:32:37] [INFO ] Time to serialize properties into /tmp/LTL9529385873018998295.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14327285912902355438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9529385873018998295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1432728...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((((((((RequestBuffer_30>=1)||(RequestBuffer_91>=1))||((RequestBuffer_34>=1)||(RequestBuffer_95>=1)))||(((RequestBuffer_38>=...2523
Formula 0 simplified : !XXF"((((((((RequestBuffer_30>=1)||(RequestBuffer_91>=1))||((RequestBuffer_34>=1)||(RequestBuffer_95>=1)))||(((RequestBuffer_38>=1)|...2515
Detected timeout of ITS tools.
[2022-05-16 02:32:52] [INFO ] Flatten gal took : 21 ms
[2022-05-16 02:32:52] [INFO ] Applying decomposition
[2022-05-16 02:32:52] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18012071716823660693.txt' '-o' '/tmp/graph18012071716823660693.bin' '-w' '/tmp/graph18012071716823660693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18012071716823660693.bin' '-l' '-1' '-v' '-w' '/tmp/graph18012071716823660693.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:32:52] [INFO ] Decomposing Gal with order
[2022-05-16 02:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:32:52] [INFO ] Removed a total of 296 redundant transitions.
[2022-05-16 02:32:52] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 02:32:52] [INFO ] Time to serialize gal into /tmp/LTL465240002840026013.gal : 4 ms
[2022-05-16 02:32:52] [INFO ] Time to serialize properties into /tmp/LTL8027161775024829280.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL465240002840026013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8027161775024829280.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4652400...244
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((((((((i45.u0.RequestBuffer_30>=1)||(u41.RequestBuffer_91>=1))||((u14.RequestBuffer_34>=1)||(u44.RequestBuffer_95>=1)))||((...2995
Formula 0 simplified : !XXF"((((((((i45.u0.RequestBuffer_30>=1)||(u41.RequestBuffer_91>=1))||((u14.RequestBuffer_34>=1)||(u44.RequestBuffer_95>=1)))||(((u1...2987
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin441862839063104503
[2022-05-16 02:33:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin441862839063104503
Running compilation step : cd /tmp/ltsmin441862839063104503;'/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 696 ms.
Running link step : cd /tmp/ltsmin441862839063104503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin441862839063104503;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-10-LTLFireability-08 finished in 87379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 101 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:22] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:22] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:22] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:33:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:33:23] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:23] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:33:23] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s86 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s29 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 653 ms.
Product exploration explored 100000 steps with 33333 reset in 681 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLFireability-09 finished in 2174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1 U !X((X(p2)&&X(p3))))))'
Support contains 401 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:24] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:24] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:24] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:25] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:33:25] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:25] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:25] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND p3 p2), (AND p3 p2), true, (AND p2 p3), (AND p3 p2), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 4}, { cond=(AND p3 p0 p2), acceptance={0} source=7 dest: 7}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={0} source=7 dest: 8}], [{ cond=(AND p3 (NOT p1) p2), acceptance={0} source=8 dest: 4}, { cond=(AND p3 p1 p2), acceptance={0} source=8 dest: 8}]], initial=3, aps=[p3:(OR (GEQ s261 1) (GEQ s257 1) (GEQ s269 1) (GEQ s265 1) (GEQ s204 1) (GEQ s277 1) (GEQ s208 1) (GEQ s273 1) (GEQ s212 1) (GEQ s285 1) (GEQ s216 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLFireability-12 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 202 transition count 400
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 399 place count 103 transition count 301
Iterating global reduction 0 with 99 rules applied. Total rules applied 498 place count 103 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 501 place count 101 transition count 300
Applied a total of 501 rules in 28 ms. Remains 101 /402 variables (removed 301) and now considering 300/500 (removed 200) transitions.
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:33:25] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 02:33:25] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:33:25] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 02:33:25] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-16 02:33:25] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:33:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:33:25] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/402 places, 300/500 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/402 places, 300/500 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s92 1) (GEQ s35 1) (GEQ s96 1) (GEQ s39 1) (GEQ s100 1) (GEQ s43 1) (GEQ s47 1) (GEQ s51 1) (GEQ s55 1) (GEQ s59 1) (GEQ s63 1) (G...], 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 2579 reset in 682 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-10-LTLFireability-14 finished in 991 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(G(F(G(p0)))))&&X(p1)&&p2)))'
Support contains 301 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:26] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:33:26] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:26] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:33:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:33:26] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:26] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:27] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s86 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s29 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 622 reset in 1521 ms.
Stuttering criterion allowed to conclude after 2068 steps with 12 reset in 36 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLFireability-15 finished in 2147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)||(G(p0)&&p0)) U !X(X(!X(p0))))))'
Found a CL insensitive property : CSRepetitions-COL-10-LTLFireability-00
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:29] [INFO ] Computed 101 place invariants in 8 ms
[2022-05-16 02:33:29] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:29] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:33:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:33:29] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:29] [INFO ] Computed 101 place invariants in 9 ms
[2022-05-16 02:33:29] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (GEQ s261 1) (GEQ s257 1) (GEQ s269 1) (GEQ s265 1) (GEQ s204 1) (GEQ s277 1) (GEQ s208 1) (GEQ s273 1) (GEQ s212 1) (GEQ s285 1) (GEQ s216 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 567 ms.
Product exploration explored 100000 steps with 20000 reset in 625 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:31] [INFO ] Computed 101 place invariants in 7 ms
[2022-05-16 02:33:32] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:32] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:33:32] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:32] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-16 02:33:32] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 599 ms.
Product exploration explored 100000 steps with 20000 reset in 607 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2022-05-16 02:33:35] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:35] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-16 02:33:35] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Product exploration explored 100000 steps with 20000 reset in 1235 ms.
Product exploration explored 100000 steps with 20000 reset in 1285 ms.
Built C files in :
/tmp/ltsmin10323432511067082351
[2022-05-16 02:33:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10323432511067082351
Running compilation step : cd /tmp/ltsmin10323432511067082351;'/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 702 ms.
Running link step : cd /tmp/ltsmin10323432511067082351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10323432511067082351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13862553654331619235.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:52] [INFO ] Computed 101 place invariants in 6 ms
[2022-05-16 02:33:53] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:53] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-16 02:33:53] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 402 cols
[2022-05-16 02:33:53] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-16 02:33:53] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin13423503902344887989
[2022-05-16 02:33:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13423503902344887989
Running compilation step : cd /tmp/ltsmin13423503902344887989;'/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 744 ms.
Running link step : cd /tmp/ltsmin13423503902344887989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13423503902344887989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5514099947426526161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:34:08] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:34:08] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:34:08] [INFO ] Time to serialize gal into /tmp/LTL10322491677415557614.gal : 3 ms
[2022-05-16 02:34:08] [INFO ] Time to serialize properties into /tmp/LTL1915522289053473107.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10322491677415557614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1915522289053473107.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1032249...267
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((((Client_Waiting_59>=1)||(Client_Waiting_55>=1))||((Client_Waiting_67>=1)||(Client_Waiting_63>=1)))||(((Client_Waiting...10419
Formula 0 simplified : !X((F"((((((((Client_Waiting_59>=1)||(Client_Waiting_55>=1))||((Client_Waiting_67>=1)||(Client_Waiting_63>=1)))||(((Client_Waiting_2...10399
Detected timeout of ITS tools.
[2022-05-16 02:34:23] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:34:23] [INFO ] Applying decomposition
[2022-05-16 02:34:23] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14166830187903143585.txt' '-o' '/tmp/graph14166830187903143585.bin' '-w' '/tmp/graph14166830187903143585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14166830187903143585.bin' '-l' '-1' '-v' '-w' '/tmp/graph14166830187903143585.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:34:23] [INFO ] Decomposing Gal with order
[2022-05-16 02:34:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:34:23] [INFO ] Removed a total of 261 redundant transitions.
[2022-05-16 02:34:23] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:34:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 02:34:23] [INFO ] Time to serialize gal into /tmp/LTL5065353099023237638.gal : 2 ms
[2022-05-16 02:34:23] [INFO ] Time to serialize properties into /tmp/LTL3037838396802994919.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5065353099023237638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3037838396802994919.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5065353...245
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((((u29.Client_Waiting_59>=1)||(u26.Client_Waiting_55>=1))||((u87.Client_Waiting_67>=1)||(u84.Client_Waiting_63>=1)))||(...11987
Formula 0 simplified : !X((F"((((((((u29.Client_Waiting_59>=1)||(u26.Client_Waiting_55>=1))||((u87.Client_Waiting_67>=1)||(u84.Client_Waiting_63>=1)))||(((...11967
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1801207930216677631
[2022-05-16 02:34:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1801207930216677631
Running compilation step : cd /tmp/ltsmin1801207930216677631;'/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 686 ms.
Running link step : cd /tmp/ltsmin1801207930216677631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1801207930216677631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))||([]((LTLAPp0==true))&&(LTLAPp0==true))) U !X(X(!X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-10-LTLFireability-00 finished in 85347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a CL insensitive property : CSRepetitions-COL-10-LTLFireability-08
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 202 transition count 400
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 399 place count 103 transition count 301
Iterating global reduction 0 with 99 rules applied. Total rules applied 498 place count 103 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 501 place count 101 transition count 300
Applied a total of 501 rules in 20 ms. Remains 101 /402 variables (removed 301) and now considering 300/500 (removed 200) transitions.
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:54] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 02:34:54] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:34:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:34:54] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 101/402 places, 300/500 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/402 places, 300/500 transitions.
Running random walk in product with property : CSRepetitions-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s31 1) (GEQ s92 1) (GEQ s35 1) (GEQ s96 1) (GEQ s39 1) (GEQ s100 1) (GEQ s43 1) (GEQ s47 1) (GEQ s51 1) (GEQ s55 1) (GEQ s59 1) (GEQ s63 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33121 reset in 256 ms.
Product exploration explored 100000 steps with 33111 reset in 264 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:55] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 02:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:34:55] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-16 02:34:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:34:56] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-16 02:34:56] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 02:34:56] [INFO ] Added : 1 causal constraints over 1 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 300/300 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 300/300 (removed 0) transitions.
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:56] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 02:34:56] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:34:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:34:56] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 300/300 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:56] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 02:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:34:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-16 02:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:34:57] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-16 02:34:57] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 02:34:57] [INFO ] Added : 1 causal constraints over 1 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33109 reset in 256 ms.
Product exploration explored 100000 steps with 33121 reset in 257 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 300/300 transitions.
Applied a total of 0 rules in 8 ms. Remains 101 /101 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2022-05-16 02:34:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 300 rows 101 cols
[2022-05-16 02:34:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:34:58] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 300/300 transitions.
Product exploration explored 100000 steps with 33112 reset in 484 ms.
Product exploration explored 100000 steps with 33111 reset in 491 ms.
Built C files in :
/tmp/ltsmin3175995078328251671
[2022-05-16 02:34:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3175995078328251671
Running compilation step : cd /tmp/ltsmin3175995078328251671;'/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 339 ms.
Running link step : cd /tmp/ltsmin3175995078328251671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3175995078328251671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10971434906578280894.hoa' '--buchi-type=spotba'
LTSmin run took 264 ms.
Treatment of property CSRepetitions-COL-10-LTLFireability-08 finished in 6028 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-08 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 02:35:00] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3511067302797673100
[2022-05-16 02:35:00] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-05-16 02:35:00] [INFO ] Applying decomposition
[2022-05-16 02:35:00] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:35:00] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-05-16 02:35:00] [INFO ] Flatten gal took : 14 ms
[2022-05-16 02:35:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13797980485238375566.txt' '-o' '/tmp/graph13797980485238375566.bin' '-w' '/tmp/graph13797980485238375566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13797980485238375566.bin' '-l' '-1' '-v' '-w' '/tmp/graph13797980485238375566.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:35:00] [INFO ] Decomposing Gal with order
[2022-05-16 02:35:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:35:00] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-05-16 02:35:00] [INFO ] Removed a total of 276 redundant transitions.
[2022-05-16 02:35:00] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:35:00] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:35:00] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3511067302797673100
Running compilation step : cd /tmp/ltsmin3511067302797673100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 02:35:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 02:35:00] [INFO ] Time to serialize gal into /tmp/LTLFireability11480852032998554352.gal : 3 ms
[2022-05-16 02:35:00] [INFO ] Time to serialize properties into /tmp/LTLFireability14822764335495955587.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11480852032998554352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14822764335495955587.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X(((F("((((((((u78.Client_Waiting_59>=1)||(u28.Client_Waiting_55>=1))||((u81.Client_Waiting_67>=1)||(u32.Client_Waiting_63>=1)))||(...12047
Formula 0 simplified : !X((F"((((((((u78.Client_Waiting_59>=1)||(u28.Client_Waiting_55>=1))||((u81.Client_Waiting_67>=1)||(u32.Client_Waiting_63>=1)))||(((...12027
Compilation finished in 1444 ms.
Running link step : cd /tmp/ltsmin3511067302797673100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3511067302797673100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((<>((LTLAPp0==true))||([]((LTLAPp0==true))&&(LTLAPp0==true))) U !X(X(!X((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 70831 ms.
FORMULA CSRepetitions-COL-10-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 367799 ms.
BK_STOP 1652668572700
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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="CSRepetitions-COL-10"
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-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-10, 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 r024-tall-165251918800612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-10.tgz
mv CSRepetitions-COL-10 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 '
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 ;