About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16248.188 | 3015925.00 | 5098345.00 | 213645.70 | F?FFT?FFT?FFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156900725.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156900725
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 61K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 114K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 12 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 12 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.4K May 11 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 11 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 11 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 35M May 12 08:13 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 MultiCrashLeafsetExtension-PT-S32C03-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-15
=== Now, execution of the tool begins
BK_START 1621382726242
Running Version 0
[2021-05-19 00:05:34] [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]
[2021-05-19 00:05:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:05:35] [INFO ] Load time of PNML (sax parser for PT used): 900 ms
[2021-05-19 00:05:35] [INFO ] Transformed 15862 places.
[2021-05-19 00:05:35] [INFO ] Transformed 25109 transitions.
[2021-05-19 00:05:35] [INFO ] Parsed PT model containing 15862 places and 25109 transitions in 1053 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 00:05:35] [INFO ] Initial state test concluded for 2 properties.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 15862 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 15820 transition count 25109
Discarding 3161 places :
Symmetric choice reduction at 1 with 3161 rule applications. Total rules 3203 place count 12659 transition count 21948
Iterating global reduction 1 with 3161 rules applied. Total rules applied 6364 place count 12659 transition count 21948
Discarding 2964 places :
Symmetric choice reduction at 1 with 2964 rule applications. Total rules 9328 place count 9695 transition count 18984
Iterating global reduction 1 with 2964 rules applied. Total rules applied 12292 place count 9695 transition count 18984
Discarding 982 places :
Symmetric choice reduction at 1 with 982 rule applications. Total rules 13274 place count 8713 transition count 16038
Iterating global reduction 1 with 982 rules applied. Total rules applied 14256 place count 8713 transition count 16038
Applied a total of 14256 rules in 8941 ms. Remains 8713 /15862 variables (removed 7149) and now considering 16038/25109 (removed 9071) transitions.
[2021-05-19 00:05:45] [INFO ] Flow matrix only has 14982 transitions (discarded 1056 similar events)
// Phase 1: matrix 14982 rows 8713 cols
[2021-05-19 00:05:46] [INFO ] Computed 1361 place invariants in 1202 ms
[2021-05-19 00:05:47] [INFO ] Implicit Places using invariants in 2411 ms returned []
Implicit Place search using SMT only with invariants took 2440 ms to find 0 implicit places.
[2021-05-19 00:05:47] [INFO ] Flow matrix only has 14982 transitions (discarded 1056 similar events)
// Phase 1: matrix 14982 rows 8713 cols
[2021-05-19 00:05:48] [INFO ] Computed 1361 place invariants in 927 ms
[2021-05-19 00:05:49] [INFO ] Dead Transitions using invariants and state equation in 1889 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8713/15862 places, 16038/25109 transitions.
[2021-05-19 00:05:50] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-19 00:05:50] [INFO ] Flatten gal took : 811 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:05:51] [INFO ] Flatten gal took : 600 ms
[2021-05-19 00:05:52] [INFO ] Input system was already deterministic with 16038 transitions.
Incomplete random walk after 100000 steps, including 3199 resets, run finished after 2177 ms. (steps per millisecond=45 ) properties (out of 22) seen :10
Running SMT prover for 12 properties.
[2021-05-19 00:05:59] [INFO ] Flow matrix only has 14982 transitions (discarded 1056 similar events)
// Phase 1: matrix 14982 rows 8713 cols
[2021-05-19 00:06:00] [INFO ] Computed 1361 place invariants in 879 ms
[2021-05-19 00:06:02] [INFO ] [Real]Absence check using 63 positive place invariants in 90 ms returned sat
[2021-05-19 00:06:03] [INFO ] [Real]Absence check using 63 positive and 1298 generalized place invariants in 585 ms returned sat
[2021-05-19 00:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:06:21] [INFO ] [Real]Absence check using state equation in 16237 ms returned unsat :0 sat :5 real:7
[2021-05-19 00:06:21] [INFO ] State equation strengthened by 6167 read => feed constraints.
[2021-05-19 00:06:21] [INFO ] [Real]Added 6167 Read/Feed constraints in 294 ms returned sat
[2021-05-19 00:06:38] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:12
[2021-05-19 00:06:40] [INFO ] [Nat]Absence check using 63 positive place invariants in 79 ms returned sat
[2021-05-19 00:06:41] [INFO ] [Nat]Absence check using 63 positive and 1298 generalized place invariants in 554 ms returned sat
[2021-05-19 00:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:06:59] [INFO ] [Nat]Absence check using state equation in 16885 ms returned unsat :0 sat :12
[2021-05-19 00:06:59] [INFO ] [Nat]Added 6167 Read/Feed constraints in 296 ms returned sat
[2021-05-19 00:07:30] [INFO ] SMT Verify possible in nat domain returned unsat :10 sat :0
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2021-05-19 00:07:30] [INFO ] Initial state test concluded for 3 properties.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 8705 transition count 16026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 8705 transition count 16026
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 8699 transition count 16010
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 8699 transition count 16010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 8698 transition count 16007
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 8698 transition count 16007
Applied a total of 30 rules in 6734 ms. Remains 8698 /8713 variables (removed 15) and now considering 16007/16038 (removed 31) transitions.
[2021-05-19 00:07:37] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2021-05-19 00:07:38] [INFO ] Computed 1361 place invariants in 947 ms
[2021-05-19 00:07:38] [INFO ] Implicit Places using invariants in 1801 ms returned []
Implicit Place search using SMT only with invariants took 1801 ms to find 0 implicit places.
[2021-05-19 00:07:38] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2021-05-19 00:07:39] [INFO ] Computed 1361 place invariants in 909 ms
[2021-05-19 00:07:40] [INFO ] Dead Transitions using invariants and state equation in 1783 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8698/8713 places, 16007/16038 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3336 1) (GEQ s3660 1) (GEQ s3663 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-00 finished in 10595 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8713 transition count 16037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8712 transition count 16037
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 203 Pre rules applied. Total rules applied 2 place count 8712 transition count 15834
Deduced a syphon composed of 203 places in 12 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 2 with 406 rules applied. Total rules applied 408 place count 8509 transition count 15834
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 414 place count 8503 transition count 15824
Iterating global reduction 2 with 6 rules applied. Total rules applied 420 place count 8503 transition count 15824
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 8503 transition count 15821
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 8500 transition count 15821
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 430 place count 8496 transition count 15809
Iterating global reduction 2 with 4 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 15 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 502 place count 8462 transition count 15775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 503 place count 8461 transition count 15774
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 8461 transition count 15774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 504 place count 8461 transition count 15773
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 8460 transition count 15773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 507 place count 8459 transition count 15770
Iterating global reduction 2 with 1 rules applied. Total rules applied 508 place count 8459 transition count 15770
Applied a total of 508 rules in 16349 ms. Remains 8459 /8713 variables (removed 254) and now considering 15770/16038 (removed 268) transitions.
[2021-05-19 00:07:57] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2021-05-19 00:07:58] [INFO ] Computed 1361 place invariants in 915 ms
[2021-05-19 00:07:59] [INFO ] Implicit Places using invariants in 1695 ms returned []
Implicit Place search using SMT only with invariants took 1696 ms to find 0 implicit places.
[2021-05-19 00:07:59] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2021-05-19 00:08:00] [INFO ] Computed 1361 place invariants in 1355 ms
[2021-05-19 00:08:01] [INFO ] Dead Transitions using invariants and state equation in 2164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8459/8713 places, 15770/16038 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5272 1) (LT s5411 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4483 reset in 1982 ms.
Product exploration explored 100000 steps with 4487 reset in 1931 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4482 reset in 1853 ms.
Product exploration explored 100000 steps with 4482 reset in 1898 ms.
[2021-05-19 00:08:10] [INFO ] Flatten gal took : 522 ms
[2021-05-19 00:08:10] [INFO ] Flatten gal took : 531 ms
[2021-05-19 00:08:10] [INFO ] Time to serialize gal into /tmp/LTL12259852259510152578.gal : 169 ms
[2021-05-19 00:08:10] [INFO ] Time to serialize properties into /tmp/LTL613409270375744139.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12259852259510152578.gal, -t, CGAL, -LTL, /tmp/LTL613409270375744139.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12259852259510152578.gal -t CGAL -LTL /tmp/LTL613409270375744139.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node25HasAskedItsLeafSetToLx2ToReplaceNode14<1)||(LeafSetOfLx2IsSentToNode25<1))"))))
Formula 0 simplified : !GF"((Node25HasAskedItsLeafSetToLx2ToReplaceNode14<1)||(LeafSetOfLx2IsSentToNode25<1))"
Detected timeout of ITS tools.
[2021-05-19 00:08:26] [INFO ] Flatten gal took : 564 ms
[2021-05-19 00:08:26] [INFO ] Applying decomposition
[2021-05-19 00:08:27] [INFO ] Flatten gal took : 598 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17087815243559569996.txt, -o, /tmp/graph17087815243559569996.bin, -w, /tmp/graph17087815243559569996.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17087815243559569996.bin, -l, -1, -v, -w, /tmp/graph17087815243559569996.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 00:08:28] [INFO ] Decomposing Gal with order
[2021-05-19 00:08:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 00:08:34] [INFO ] Removed a total of 14141 redundant transitions.
[2021-05-19 00:08:35] [INFO ] Flatten gal took : 5216 ms
[2021-05-19 00:08:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8186 labels/synchronizations in 1453 ms.
[2021-05-19 00:08:37] [INFO ] Time to serialize gal into /tmp/LTL6160576528123069236.gal : 102 ms
[2021-05-19 00:08:37] [INFO ] Time to serialize properties into /tmp/LTL12435112567037047902.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6160576528123069236.gal, -t, CGAL, -LTL, /tmp/LTL12435112567037047902.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6160576528123069236.gal -t CGAL -LTL /tmp/LTL12435112567037047902.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i1.u3.Node25HasAskedItsLeafSetToLx2ToReplaceNode14<1)||(i1.i1.u452.LeafSetOfLx2IsSentToNode25<1))"))))
Formula 0 simplified : !GF"((i1.i1.u3.Node25HasAskedItsLeafSetToLx2ToReplaceNode14<1)||(i1.i1.u452.LeafSetOfLx2IsSentToNode25<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1439296692898070493
[2021-05-19 00:08:52] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1439296692898070493
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1439296692898070493]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1439296692898070493] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1439296692898070493] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-01 finished in 72827 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8713 transition count 16037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8712 transition count 16037
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 203 Pre rules applied. Total rules applied 2 place count 8712 transition count 15834
Deduced a syphon composed of 203 places in 19 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 2 with 406 rules applied. Total rules applied 408 place count 8509 transition count 15834
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 414 place count 8503 transition count 15824
Iterating global reduction 2 with 6 rules applied. Total rules applied 420 place count 8503 transition count 15824
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 8503 transition count 15821
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 8500 transition count 15821
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 430 place count 8496 transition count 15809
Iterating global reduction 2 with 4 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 62 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 502 place count 8462 transition count 15775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 503 place count 8461 transition count 15774
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 8461 transition count 15774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 504 place count 8461 transition count 15773
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 8460 transition count 15773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 507 place count 8459 transition count 15770
Iterating global reduction 2 with 1 rules applied. Total rules applied 508 place count 8459 transition count 15770
Applied a total of 508 rules in 16700 ms. Remains 8459 /8713 variables (removed 254) and now considering 15770/16038 (removed 268) transitions.
[2021-05-19 00:09:10] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2021-05-19 00:09:11] [INFO ] Computed 1361 place invariants in 869 ms
[2021-05-19 00:09:12] [INFO ] Implicit Places using invariants in 1759 ms returned []
Implicit Place search using SMT only with invariants took 1775 ms to find 0 implicit places.
[2021-05-19 00:09:12] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2021-05-19 00:09:13] [INFO ] Computed 1361 place invariants in 943 ms
[2021-05-19 00:09:13] [INFO ] Dead Transitions using invariants and state equation in 1717 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8459/8713 places, 15770/16038 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2658 1) (GEQ s2833 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-03 finished in 20294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8713 transition count 16037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8712 transition count 16037
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 203 Pre rules applied. Total rules applied 2 place count 8712 transition count 15834
Deduced a syphon composed of 203 places in 14 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 2 with 406 rules applied. Total rules applied 408 place count 8509 transition count 15834
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 414 place count 8503 transition count 15824
Iterating global reduction 2 with 6 rules applied. Total rules applied 420 place count 8503 transition count 15824
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 8503 transition count 15821
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 8500 transition count 15821
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 430 place count 8496 transition count 15809
Iterating global reduction 2 with 4 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 15 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 502 place count 8462 transition count 15775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 503 place count 8461 transition count 15774
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 8461 transition count 15774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 504 place count 8461 transition count 15773
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 8460 transition count 15773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 507 place count 8459 transition count 15770
Iterating global reduction 2 with 1 rules applied. Total rules applied 508 place count 8459 transition count 15770
Applied a total of 508 rules in 16248 ms. Remains 8459 /8713 variables (removed 254) and now considering 15770/16038 (removed 268) transitions.
[2021-05-19 00:09:30] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2021-05-19 00:09:31] [INFO ] Computed 1361 place invariants in 878 ms
[2021-05-19 00:09:32] [INFO ] Implicit Places using invariants in 1865 ms returned []
Implicit Place search using SMT only with invariants took 1866 ms to find 0 implicit places.
[2021-05-19 00:09:32] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2021-05-19 00:09:33] [INFO ] Computed 1361 place invariants in 974 ms
[2021-05-19 00:09:33] [INFO ] Dead Transitions using invariants and state equation in 1805 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8459/8713 places, 15770/16038 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5426 1) (LT s5672 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4327 reset in 1918 ms.
Product exploration explored 100000 steps with 4327 reset in 1972 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4328 reset in 1928 ms.
Product exploration explored 100000 steps with 4329 reset in 1927 ms.
[2021-05-19 00:09:42] [INFO ] Flatten gal took : 647 ms
[2021-05-19 00:09:43] [INFO ] Flatten gal took : 487 ms
[2021-05-19 00:09:43] [INFO ] Time to serialize gal into /tmp/LTL2013391325650668689.gal : 48 ms
[2021-05-19 00:09:43] [INFO ] Time to serialize properties into /tmp/LTL3883498299805114161.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2013391325650668689.gal, -t, CGAL, -LTL, /tmp/LTL3883498299805114161.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2013391325650668689.gal -t CGAL -LTL /tmp/LTL3883498299805114161.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node26HasAskedItsLeafSetToLx0ToReplaceNode1<1)||(LeafSetOfLx0IsSentToNode26<1))"))))
Formula 0 simplified : !FG"((Node26HasAskedItsLeafSetToLx0ToReplaceNode1<1)||(LeafSetOfLx0IsSentToNode26<1))"
Detected timeout of ITS tools.
[2021-05-19 00:09:58] [INFO ] Flatten gal took : 501 ms
[2021-05-19 00:09:58] [INFO ] Applying decomposition
[2021-05-19 00:09:59] [INFO ] Flatten gal took : 510 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4975301909893824757.txt, -o, /tmp/graph4975301909893824757.bin, -w, /tmp/graph4975301909893824757.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4975301909893824757.bin, -l, -1, -v, -w, /tmp/graph4975301909893824757.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 00:10:00] [INFO ] Decomposing Gal with order
[2021-05-19 00:10:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 00:10:05] [INFO ] Removed a total of 13878 redundant transitions.
[2021-05-19 00:10:05] [INFO ] Flatten gal took : 3914 ms
[2021-05-19 00:10:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 9060 labels/synchronizations in 1446 ms.
[2021-05-19 00:10:08] [INFO ] Time to serialize gal into /tmp/LTL14107142457749552229.gal : 85 ms
[2021-05-19 00:10:08] [INFO ] Time to serialize properties into /tmp/LTL5846743155223676980.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14107142457749552229.gal, -t, CGAL, -LTL, /tmp/LTL5846743155223676980.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14107142457749552229.gal -t CGAL -LTL /tmp/LTL5846743155223676980.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i3.u4.Node26HasAskedItsLeafSetToLx0ToReplaceNode1<1)||(i3.u635.LeafSetOfLx0IsSentToNode26<1))"))))
Formula 0 simplified : !FG"((i3.u4.Node26HasAskedItsLeafSetToLx0ToReplaceNode1<1)||(i3.u635.LeafSetOfLx0IsSentToNode26<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8487677904659836237
[2021-05-19 00:10:23] [INFO ] Built C files in 254ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8487677904659836237
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8487677904659836237]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8487677904659836237] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8487677904659836237] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-05 finished in 70273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 8707 transition count 16028
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 8707 transition count 16028
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 8703 transition count 16016
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 8703 transition count 16016
Applied a total of 20 rules in 7218 ms. Remains 8703 /8713 variables (removed 10) and now considering 16016/16038 (removed 22) transitions.
[2021-05-19 00:10:31] [INFO ] Flow matrix only has 14960 transitions (discarded 1056 similar events)
// Phase 1: matrix 14960 rows 8703 cols
[2021-05-19 00:10:32] [INFO ] Computed 1361 place invariants in 856 ms
[2021-05-19 00:10:33] [INFO ] Implicit Places using invariants in 1674 ms returned []
Implicit Place search using SMT only with invariants took 1675 ms to find 0 implicit places.
[2021-05-19 00:10:33] [INFO ] Flow matrix only has 14960 transitions (discarded 1056 similar events)
// Phase 1: matrix 14960 rows 8703 cols
[2021-05-19 00:10:34] [INFO ] Computed 1361 place invariants in 872 ms
[2021-05-19 00:10:34] [INFO ] Dead Transitions using invariants and state equation in 1697 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8703/8713 places, 16016/16038 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1854 1) (GEQ s1950 1)), p1:(AND (GEQ s1028 1) (OR (LT s1854 1) (LT s1950 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-07 finished in 10801 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 8706 transition count 16029
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 8706 transition count 16029
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 8700 transition count 16013
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 8700 transition count 16013
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 8699 transition count 16010
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 8699 transition count 16010
Applied a total of 28 rules in 9874 ms. Remains 8699 /8713 variables (removed 14) and now considering 16010/16038 (removed 28) transitions.
[2021-05-19 00:10:45] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
// Phase 1: matrix 14954 rows 8699 cols
[2021-05-19 00:10:45] [INFO ] Computed 1361 place invariants in 854 ms
[2021-05-19 00:10:46] [INFO ] Implicit Places using invariants in 1676 ms returned []
Implicit Place search using SMT only with invariants took 1677 ms to find 0 implicit places.
[2021-05-19 00:10:46] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
// Phase 1: matrix 14954 rows 8699 cols
[2021-05-19 00:10:47] [INFO ] Computed 1361 place invariants in 996 ms
[2021-05-19 00:10:48] [INFO ] Dead Transitions using invariants and state equation in 1812 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8699/8713 places, 16010/16038 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (LT s240 1) (LT s8517 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 6208 ms.
Product exploration explored 100000 steps with 25000 reset in 6144 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 5987 ms.
Product exploration explored 100000 steps with 25000 reset in 5938 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8699 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8699/8699 places, 16010/16010 transitions.
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 204 Pre rules applied. Total rules applied 0 place count 8699 transition count 16010
Deduced a syphon composed of 204 places in 12 ms
Iterating global reduction 0 with 204 rules applied. Total rules applied 204 place count 8699 transition count 16010
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 237 places in 13 ms
Iterating global reduction 0 with 33 rules applied. Total rules applied 237 place count 8699 transition count 16010
Deduced a syphon composed of 237 places in 12 ms
Applied a total of 237 rules in 4705 ms. Remains 8699 /8699 variables (removed 0) and now considering 16010/16010 (removed 0) transitions.
[2021-05-19 00:11:17] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
// Phase 1: matrix 14954 rows 8699 cols
[2021-05-19 00:11:18] [INFO ] Computed 1361 place invariants in 926 ms
[2021-05-19 00:11:19] [INFO ] Dead Transitions using invariants and state equation in 1753 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8699/8699 places, 16010/16010 transitions.
Product exploration timeout after 31040 steps with 7760 reset in 10003 ms.
Product exploration timeout after 31340 steps with 7835 reset in 10002 ms.
[2021-05-19 00:11:40] [INFO ] Flatten gal took : 508 ms
[2021-05-19 00:11:41] [INFO ] Flatten gal took : 529 ms
[2021-05-19 00:11:41] [INFO ] Time to serialize gal into /tmp/LTL8994054548057185649.gal : 52 ms
[2021-05-19 00:11:41] [INFO ] Time to serialize properties into /tmp/LTL6286073059603709717.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8994054548057185649.gal, -t, CGAL, -LTL, /tmp/LTL6286073059603709717.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8994054548057185649.gal -t CGAL -LTL /tmp/LTL6286073059603709717.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((Node0ManageTheCrashOfNode15<1)||(Lx0IsAtTheLeftExtremityOfTheLeafSet<1))"))))))
Formula 0 simplified : !XXXF"((Node0ManageTheCrashOfNode15<1)||(Lx0IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
[2021-05-19 00:11:56] [INFO ] Flatten gal took : 507 ms
[2021-05-19 00:11:56] [INFO ] Applying decomposition
[2021-05-19 00:11:57] [INFO ] Flatten gal took : 520 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9021972202128276579.txt, -o, /tmp/graph9021972202128276579.bin, -w, /tmp/graph9021972202128276579.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9021972202128276579.bin, -l, -1, -v, -w, /tmp/graph9021972202128276579.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 00:11:58] [INFO ] Decomposing Gal with order
[2021-05-19 00:11:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 00:12:02] [INFO ] Removed a total of 12743 redundant transitions.
[2021-05-19 00:12:02] [INFO ] Flatten gal took : 2686 ms
[2021-05-19 00:12:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 8027 labels/synchronizations in 1060 ms.
[2021-05-19 00:12:04] [INFO ] Time to serialize gal into /tmp/LTL10916304823918626472.gal : 86 ms
[2021-05-19 00:12:04] [INFO ] Time to serialize properties into /tmp/LTL1748836142394069149.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10916304823918626472.gal, -t, CGAL, -LTL, /tmp/LTL1748836142394069149.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10916304823918626472.gal -t CGAL -LTL /tmp/LTL1748836142394069149.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i54.u18.Node0ManageTheCrashOfNode15<1)||(i54.u776.Lx0IsAtTheLeftExtremityOfTheLeafSet<1))"))))))
Formula 0 simplified : !XXXF"((i54.u18.Node0ManageTheCrashOfNode15<1)||(i54.u776.Lx0IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8735240311925834309
[2021-05-19 00:12:19] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8735240311925834309
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8735240311925834309]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8735240311925834309] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8735240311925834309] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-09 finished in 105489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8713 transition count 16037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8712 transition count 16037
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 204 Pre rules applied. Total rules applied 2 place count 8712 transition count 15833
Deduced a syphon composed of 204 places in 22 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 2 with 408 rules applied. Total rules applied 410 place count 8508 transition count 15833
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 417 place count 8501 transition count 15822
Iterating global reduction 2 with 7 rules applied. Total rules applied 424 place count 8501 transition count 15822
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 424 place count 8501 transition count 15818
Deduced a syphon composed of 4 places in 25 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 432 place count 8497 transition count 15818
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 437 place count 8492 transition count 15803
Iterating global reduction 2 with 5 rules applied. Total rules applied 442 place count 8492 transition count 15803
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 13 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 510 place count 8458 transition count 15769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 511 place count 8457 transition count 15768
Iterating global reduction 2 with 1 rules applied. Total rules applied 512 place count 8457 transition count 15768
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 512 place count 8457 transition count 15767
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 514 place count 8456 transition count 15767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 515 place count 8455 transition count 15764
Iterating global reduction 2 with 1 rules applied. Total rules applied 516 place count 8455 transition count 15764
Applied a total of 516 rules in 10462 ms. Remains 8455 /8713 variables (removed 258) and now considering 15764/16038 (removed 274) transitions.
[2021-05-19 00:12:31] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2021-05-19 00:12:31] [INFO ] Computed 1361 place invariants in 887 ms
[2021-05-19 00:12:32] [INFO ] Implicit Places using invariants in 1524 ms returned []
Implicit Place search using SMT only with invariants took 1524 ms to find 0 implicit places.
[2021-05-19 00:12:32] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2021-05-19 00:12:33] [INFO ] Computed 1361 place invariants in 887 ms
[2021-05-19 00:12:34] [INFO ] Dead Transitions using invariants and state equation in 1693 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8455/8713 places, 15764/16038 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3262 1) (GEQ s3288 1) (GEQ s3289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-10 finished in 13761 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 8713 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8713/8713 places, 16038/16038 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8713 transition count 16037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8712 transition count 16037
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 204 Pre rules applied. Total rules applied 2 place count 8712 transition count 15833
Deduced a syphon composed of 204 places in 14 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 2 with 408 rules applied. Total rules applied 410 place count 8508 transition count 15833
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 417 place count 8501 transition count 15822
Iterating global reduction 2 with 7 rules applied. Total rules applied 424 place count 8501 transition count 15822
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 424 place count 8501 transition count 15818
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 432 place count 8497 transition count 15818
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 437 place count 8492 transition count 15803
Iterating global reduction 2 with 5 rules applied. Total rules applied 442 place count 8492 transition count 15803
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 16 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 508 place count 8459 transition count 15770
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 509 place count 8458 transition count 15769
Iterating global reduction 2 with 1 rules applied. Total rules applied 510 place count 8458 transition count 15769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 510 place count 8458 transition count 15768
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 512 place count 8457 transition count 15768
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 513 place count 8456 transition count 15765
Iterating global reduction 2 with 1 rules applied. Total rules applied 514 place count 8456 transition count 15765
Applied a total of 514 rules in 10134 ms. Remains 8456 /8713 variables (removed 257) and now considering 15765/16038 (removed 273) transitions.
[2021-05-19 00:12:44] [INFO ] Flow matrix only has 14709 transitions (discarded 1056 similar events)
// Phase 1: matrix 14709 rows 8456 cols
[2021-05-19 00:12:45] [INFO ] Computed 1361 place invariants in 953 ms
[2021-05-19 00:12:46] [INFO ] Implicit Places using invariants in 1606 ms returned []
Implicit Place search using SMT only with invariants took 1607 ms to find 0 implicit places.
[2021-05-19 00:12:46] [INFO ] Flow matrix only has 14709 transitions (discarded 1056 similar events)
// Phase 1: matrix 14709 rows 8456 cols
[2021-05-19 00:12:47] [INFO ] Computed 1361 place invariants in 1107 ms
[2021-05-19 00:12:47] [INFO ] Dead Transitions using invariants and state equation in 1768 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8456/8713 places, 15765/16038 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s5187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-12 finished in 13580 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10787694215690350366
[2021-05-19 00:12:48] [INFO ] Too many transitions (16038) to apply POR reductions. Disabling POR matrices.
[2021-05-19 00:12:48] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10787694215690350366
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10787694215690350366]
[2021-05-19 00:12:48] [INFO ] Applying decomposition
[2021-05-19 00:12:49] [INFO ] Flatten gal took : 1122 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6230871711877003140.txt, -o, /tmp/graph6230871711877003140.bin, -w, /tmp/graph6230871711877003140.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6230871711877003140.bin, -l, -1, -v, -w, /tmp/graph6230871711877003140.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 00:12:51] [INFO ] Decomposing Gal with order
[2021-05-19 00:12:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 00:12:57] [INFO ] Removed a total of 12923 redundant transitions.
[2021-05-19 00:12:57] [INFO ] Flatten gal took : 4032 ms
[2021-05-19 00:12:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8211 labels/synchronizations in 1572 ms.
[2021-05-19 00:13:00] [INFO ] Time to serialize gal into /tmp/LTLFireability16835762503891490191.gal : 141 ms
[2021-05-19 00:13:00] [INFO ] Time to serialize properties into /tmp/LTLFireability9926163499512531750.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16835762503891490191.gal, -t, CGAL, -LTL, /tmp/LTLFireability9926163499512531750.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16835762503891490191.gal -t CGAL -LTL /tmp/LTLFireability9926163499512531750.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F(("((i25.i1.i0.u268.Node8ThinksNode22ShouldBeNodeMasterToReplaceNode12>=1)&&(i25.i1.i2.u409.Node22NotifyThatHeIsActive>=1))")||((!("((i2.u5.Node25HasAskedItsLeafSetToLx2ToReplaceNode14>=1)&&(i2.u479.LeafSetOfLx2IsSentToNode25>=1))"))&&(X((!("((i29.u328.Node12NotifyThatHeIsActive>=1)&&(i46.u677.Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))U(((!("((i29.u328.Node12NotifyThatHeIsActive>=1)&&(i46.u677.Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))&&(F(!("((i21.u75.Node1ThinksNode9ShouldBeNodeMasterToReplaceNode22>=1)&&(i25.i1.i0.u283.Node9NotifyThatHeIsActive>=1))"))))||(G(!("((i29.u328.Node12NotifyThatHeIsActive>=1)&&(i46.u677.Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))")))))))))))
Formula 0 simplified : !GF("((i25.i1.i0.u268.Node8ThinksNode22ShouldBeNodeMasterToReplaceNode12>=1)&&(i25.i1.i2.u409.Node22NotifyThatHeIsActive>=1))" | (!"((i2.u5.Node25HasAskedItsLeafSetToLx2ToReplaceNode14>=1)&&(i2.u479.LeafSetOfLx2IsSentToNode25>=1))" & X(!"((i29.u328.Node12NotifyThatHeIsActive>=1)&&(i46.u677.Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))" U ((!"((i29.u328.Node12NotifyThatHeIsActive>=1)&&(i46.u677.Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))" & F!"((i21.u75.Node1ThinksNode9ShouldBeNodeMasterToReplaceNode22>=1)&&(i25.i1.i0.u283.Node9NotifyThatHeIsActive>=1))") | G!"((i29.u328.Node12NotifyThatHeIsActive>=1)&&(i46.u677.Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10787694215690350366] killed by timeout after 30 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10787694215690350366] killed by timeout after 30 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
ITS-tools command line returned an error code 137
[2021-05-19 00:20:42] [INFO ] Flatten gal took : 5165 ms
[2021-05-19 00:20:43] [INFO ] Time to serialize gal into /tmp/LTLFireability600067895110947068.gal : 194 ms
[2021-05-19 00:20:43] [INFO ] Time to serialize properties into /tmp/LTLFireability13206563027212243680.ltl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability600067895110947068.gal, -t, CGAL, -LTL, /tmp/LTLFireability13206563027212243680.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability600067895110947068.gal -t CGAL -LTL /tmp/LTLFireability13206563027212243680.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F(("((Node8ThinksNode22ShouldBeNodeMasterToReplaceNode12>=1)&&(Node22NotifyThatHeIsActive>=1))")||((!("((Node25HasAskedItsLeafSetToLx2ToReplaceNode14>=1)&&(LeafSetOfLx2IsSentToNode25>=1))"))&&(X((!("((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))U(((!("((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))&&(F(!("((Node1ThinksNode9ShouldBeNodeMasterToReplaceNode22>=1)&&(Node9NotifyThatHeIsActive>=1))"))))||(G(!("((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))")))))))))))
Formula 0 simplified : !GF("((Node8ThinksNode22ShouldBeNodeMasterToReplaceNode12>=1)&&(Node22NotifyThatHeIsActive>=1))" | (!"((Node25HasAskedItsLeafSetToLx2ToReplaceNode14>=1)&&(LeafSetOfLx2IsSentToNode25>=1))" & X(!"((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))" U ((!"((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))" & F!"((Node1ThinksNode9ShouldBeNodeMasterToReplaceNode22>=1)&&(Node9NotifyThatHeIsActive>=1))") | G!"((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))))
ITS-tools command line returned an error code 137
[2021-05-19 00:37:46] [INFO ] Flatten gal took : 2804 ms
[2021-05-19 00:37:55] [INFO ] Input system was already deterministic with 16038 transitions.
[2021-05-19 00:37:55] [INFO ] Transformed 8713 places.
[2021-05-19 00:37:55] [INFO ] Transformed 16038 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-19 00:38:29] [INFO ] Time to serialize gal into /tmp/LTLFireability6498765147432495608.gal : 49 ms
[2021-05-19 00:38:29] [INFO ] Time to serialize properties into /tmp/LTLFireability13185087322484118901.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability6498765147432495608.gal, -t, CGAL, -LTL, /tmp/LTLFireability13185087322484118901.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6498765147432495608.gal -t CGAL -LTL /tmp/LTLFireability13185087322484118901.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((Node8ThinksNode22ShouldBeNodeMasterToReplaceNode12>=1)&&(Node22NotifyThatHeIsActive>=1))")||((!("((Node25HasAskedItsLeafSetToLx2ToReplaceNode14>=1)&&(LeafSetOfLx2IsSentToNode25>=1))"))&&(X((!("((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))U(((!("((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))&&(F(!("((Node1ThinksNode9ShouldBeNodeMasterToReplaceNode22>=1)&&(Node9NotifyThatHeIsActive>=1))"))))||(G(!("((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))")))))))))))
Formula 0 simplified : !GF("((Node8ThinksNode22ShouldBeNodeMasterToReplaceNode12>=1)&&(Node22NotifyThatHeIsActive>=1))" | (!"((Node25HasAskedItsLeafSetToLx2ToReplaceNode14>=1)&&(LeafSetOfLx2IsSentToNode25>=1))" & X(!"((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))" U ((!"((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))" & F!"((Node1ThinksNode9ShouldBeNodeMasterToReplaceNode22>=1)&&(Node9NotifyThatHeIsActive>=1))") | G!"((Node12NotifyThatHeIsActive>=1)&&(Node32ThinksNode12ShouldBeNodeMasterToReplaceNode13>=1))"))))
ITS-tools command line returned an error code 137
BK_STOP 1621385742167
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="MultiCrashLeafsetExtension-PT-S32C03"
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 MultiCrashLeafsetExtension-PT-S32C03, 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 r292-tall-162124156900725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C03.tgz
mv MultiCrashLeafsetExtension-PT-S32C03 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 ;