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.r140-tall-162089127200044.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 NQueens-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 07:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 203K May 5 16:51 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 NQueens-PT-15-00
FORMULA_NAME NQueens-PT-15-01
FORMULA_NAME NQueens-PT-15-02
FORMULA_NAME NQueens-PT-15-03
FORMULA_NAME NQueens-PT-15-04
FORMULA_NAME NQueens-PT-15-05
FORMULA_NAME NQueens-PT-15-06
FORMULA_NAME NQueens-PT-15-07
FORMULA_NAME NQueens-PT-15-08
FORMULA_NAME NQueens-PT-15-09
FORMULA_NAME NQueens-PT-15-10
FORMULA_NAME NQueens-PT-15-11
FORMULA_NAME NQueens-PT-15-12
FORMULA_NAME NQueens-PT-15-13
FORMULA_NAME NQueens-PT-15-14
FORMULA_NAME NQueens-PT-15-15

=== Now, execution of the tool begins

BK_START 1620919909280

Running Version 0
[2021-05-13 15:32:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 15:32:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 15:32:03] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-13 15:32:03] [INFO ] Transformed 315 places.
[2021-05-13 15:32:03] [INFO ] Transformed 225 transitions.
[2021-05-13 15:32:03] [INFO ] Parsed PT model containing 315 places and 225 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 15:32:03] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-15-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 225/225 transitions.
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 119 transition count 225
Applied a total of 194 rules in 18 ms. Remains 119 /313 variables (removed 194) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 119 cols
[2021-05-13 15:32:04] [INFO ] Computed 8 place invariants in 37 ms
[2021-05-13 15:32:04] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 225 rows 119 cols
[2021-05-13 15:32:04] [INFO ] Computed 8 place invariants in 25 ms
[2021-05-13 15:32:04] [INFO ] Implicit Places using invariants and state equation in 324 ms returned [61, 89, 90, 118]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 577 ms to find 4 implicit places.
// Phase 1: matrix 225 rows 115 cols
[2021-05-13 15:32:04] [INFO ] Invariants computation overflowed in 14 ms
[2021-05-13 15:32:04] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Starting structural reductions, iteration 1 : 115/313 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 115 cols
[2021-05-13 15:32:04] [INFO ] Invariants computation overflowed in 10 ms
[2021-05-13 15:32:04] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 2 iterations. Remains : 115/313 places, 225/225 transitions.
[2021-05-13 15:32:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 15:32:05] [INFO ] Flatten gal took : 57 ms
FORMULA NQueens-PT-15-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 15:32:05] [INFO ] Flatten gal took : 27 ms
[2021-05-13 15:32:05] [INFO ] Input system was already deterministic with 225 transitions.
Incomplete random walk after 100000 steps, including 7208 resets, run finished after 1766 ms. (steps per millisecond=56 ) properties (out of 22) seen :17
Running SMT prover for 5 properties.
// Phase 1: matrix 225 rows 115 cols
[2021-05-13 15:32:06] [INFO ] Invariants computation overflowed in 10 ms
[2021-05-13 15:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:32:06] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2021-05-13 15:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:32:07] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2021-05-13 15:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:32:07] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-13 15:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:32:07] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2021-05-13 15:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:32:07] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2021-05-13 15:32:07] [INFO ] Initial state test concluded for 3 properties.
FORMULA NQueens-PT-15-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(!p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 86 transition count 225
Applied a total of 29 rules in 5 ms. Remains 86 /115 variables (removed 29) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:32:07] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-13 15:32:07] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:32:07] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 15:32:07] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:32:07] [INFO ] Computed 3 place invariants in 12 ms
[2021-05-13 15:32:07] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), false, false, (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-15-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT 1 s1), p0:(LEQ 1 s0)], 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 48639 reset in 2567 ms.
Product exploration explored 100000 steps with 48546 reset in 2544 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p0)]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, -F, /tmp/curaut1099240384855567165.hoa, --complement], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.buildComplement(SpotRunner.java:532)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:367)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), false, false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 48761 reset in 2469 ms.
Product exploration explored 100000 steps with 48716 reset in 2507 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), false, false, (AND (NOT p1) p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 86/86 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2021-05-13 15:32:31] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:32:31] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 15:32:31] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 225/225 transitions.
Product exploration explored 100000 steps with 48851 reset in 2338 ms.
Product exploration explored 100000 steps with 48675 reset in 2345 ms.
[2021-05-13 15:32:44] [INFO ] Flatten gal took : 20 ms
[2021-05-13 15:32:44] [INFO ] Flatten gal took : 19 ms
[2021-05-13 15:32:45] [INFO ] Time to serialize gal into /tmp/LTL14199772130120291130.gal : 279 ms
[2021-05-13 15:32:45] [INFO ] Time to serialize properties into /tmp/LTL10500125955726482051.ltl : 74 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/LTL14199772130120291130.gal, -t, CGAL, -LTL, /tmp/LTL10500125955726482051.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/LTL14199772130120291130.gal -t CGAL -LTL /tmp/LTL10500125955726482051.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(P_7_8>=1)")||(G("(P_7_8<1)")))||(F("(P_8_7<1)")))))
Formula 0 simplified : !X("(P_7_8>=1)" | G"(P_7_8<1)" | F"(P_8_7<1)")
Detected timeout of ITS tools.
[2021-05-13 15:33:03] [INFO ] Flatten gal took : 18 ms
[2021-05-13 15:33:03] [INFO ] Applying decomposition
[2021-05-13 15:33:03] [INFO ] Flatten gal took : 20 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/graph10277886123709236190.txt, -o, /tmp/graph10277886123709236190.bin, -w, /tmp/graph10277886123709236190.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/graph10277886123709236190.bin, -l, -1, -v, -w, /tmp/graph10277886123709236190.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 15:33:04] [INFO ] Decomposing Gal with order
[2021-05-13 15:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 15:33:04] [INFO ] Removed a total of 805 redundant transitions.
[2021-05-13 15:33:04] [INFO ] Flatten gal took : 57 ms
[2021-05-13 15:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-13 15:33:04] [INFO ] Time to serialize gal into /tmp/LTL9307246374440051454.gal : 4 ms
[2021-05-13 15:33:04] [INFO ] Time to serialize properties into /tmp/LTL8095572128620944505.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/LTL9307246374440051454.gal, -t, CGAL, -LTL, /tmp/LTL8095572128620944505.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/LTL9307246374440051454.gal -t CGAL -LTL /tmp/LTL8095572128620944505.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(u0.P_7_8>=1)")||(G("(u0.P_7_8<1)")))||(F("(u1.P_8_7<1)")))))
Formula 0 simplified : !X("(u0.P_7_8>=1)" | G"(u0.P_7_8<1)" | F"(u1.P_8_7<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5406705401610352851
[2021-05-13 15:33:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5406705401610352851
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/ltsmin5406705401610352851]
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/ltsmin5406705401610352851] 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/ltsmin5406705401610352851] 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 NQueens-PT-15-02 finished in 77316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0)||(p1&&X(G(p2)))) U p2))], workingDir=/home/mcc/execution]
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 88 transition count 225
Applied a total of 27 rules in 4 ms. Remains 88 /115 variables (removed 27) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:24] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:24] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:24] [INFO ] Invariants computation overflowed in 11 ms
[2021-05-13 15:33:24] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:24] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:24] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-15-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s50 s3), p0:(GT s0 s1), p1:(OR (LEQ s76 s2) (LEQ s50 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-15-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-04 finished in 549 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 88 transition count 225
Applied a total of 27 rules in 3 ms. Remains 88 /115 variables (removed 27) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:25] [INFO ] Invariants computation overflowed in 11 ms
[2021-05-13 15:33:25] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:25] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:25] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:25] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:25] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s0 s1), p1:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 118 steps with 35 reset in 4 ms.
FORMULA NQueens-PT-15-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-05 finished in 542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 86 transition count 225
Applied a total of 29 rules in 3 ms. Remains 86 /115 variables (removed 29) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:25] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:25] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:25] [INFO ] Invariants computation overflowed in 10 ms
[2021-05-13 15:33:25] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:25] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s0 s1)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 187 steps with 13 reset in 3 ms.
FORMULA NQueens-PT-15-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-06 finished in 495 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 84 transition count 225
Applied a total of 31 rules in 3 ms. Remains 84 /115 variables (removed 31) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2021-05-13 15:33:26] [INFO ] Invariants computation overflowed in 8 ms
[2021-05-13 15:33:26] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2021-05-13 15:33:26] [INFO ] Invariants computation overflowed in 8 ms
[2021-05-13 15:33:26] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2021-05-13 15:33:26] [INFO ] Invariants computation overflowed in 12 ms
[2021-05-13 15:33:26] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-08 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:(GT s15 s16)], 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 0 ms.
FORMULA NQueens-PT-15-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-08 finished in 431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Graph (complete) has 123 edges and 115 vertex of which 88 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 88 /115 variables (removed 27) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:26] [INFO ] Invariants computation overflowed in 8 ms
[2021-05-13 15:33:26] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:26] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:26] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2021-05-13 15:33:26] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 225 rows 88 cols
[2021-05-13 15:33:26] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:26] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-15-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 (GT s2 s1) (LEQ s3 s0) (GT s43 s81))], 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 13 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-15-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-10 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Graph (complete) has 123 edges and 115 vertex of which 85 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 85 /115 variables (removed 30) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 85 cols
[2021-05-13 15:33:26] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 15:33:27] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 225 rows 85 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 15:33:27] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2021-05-13 15:33:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 225 rows 85 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 15:33:27] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-15-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s35 s0)], 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 39 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-15-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-11 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 86 transition count 225
Applied a total of 29 rules in 1 ms. Remains 86 /115 variables (removed 29) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 15:33:27] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-13 15:33:27] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 15:33:27] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 515 steps with 251 reset in 13 ms.
FORMULA NQueens-PT-15-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-12 finished in 472 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 86 transition count 225
Applied a total of 29 rules in 1 ms. Remains 86 /115 variables (removed 29) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 15:33:27] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:27] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 15:33:28] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 86 cols
[2021-05-13 15:33:28] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 15:33:28] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 11232 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-13 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:(LEQ s1 s0)], 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 191 steps with 13 reset in 3 ms.
FORMULA NQueens-PT-15-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-13 finished in 11718 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 225/225 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 87 transition count 225
Applied a total of 28 rules in 2 ms. Remains 87 /115 variables (removed 28) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 87 cols
[2021-05-13 15:33:39] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:39] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 225 rows 87 cols
[2021-05-13 15:33:39] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:39] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 87 cols
[2021-05-13 15:33:39] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-13 15:33:39] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/115 places, 225/225 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-15-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1 s2), p1:(AND (LEQ s0 s78) (LEQ 1 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-15-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-14 finished in 456 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15860210073118595102
[2021-05-13 15:33:40] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2021-05-13 15:33:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 15:33:40] [INFO ] Applying decomposition
[2021-05-13 15:33:40] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2021-05-13 15:33:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 15:33:40] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2021-05-13 15:33:40] [INFO ] Flatten gal took : 17 ms
[2021-05-13 15:33:40] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 15:33:40] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15860210073118595102
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/ltsmin15860210073118595102]
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/graph15454039241330454618.txt, -o, /tmp/graph15454039241330454618.bin, -w, /tmp/graph15454039241330454618.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/graph15454039241330454618.bin, -l, -1, -v, -w, /tmp/graph15454039241330454618.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 15:33:40] [INFO ] Decomposing Gal with order
[2021-05-13 15:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 15:33:40] [INFO ] Removed a total of 750 redundant transitions.
[2021-05-13 15:33:40] [INFO ] Flatten gal took : 37 ms
[2021-05-13 15:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-13 15:33:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality17723094974510413209.gal : 3 ms
[2021-05-13 15:33:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality10905699590436593516.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/LTLCardinality17723094974510413209.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10905699590436593516.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/LTLCardinality17723094974510413209.gal -t CGAL -LTL /tmp/LTLCardinality10905699590436593516.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("(i13.u35.P_7_8>=1)")||(G("(i13.u35.P_7_8<1)")))||(F("(i13.u21.P_8_7<1)")))))
Formula 0 simplified : !X("(i13.u35.P_7_8>=1)" | G"(i13.u35.P_7_8<1)" | F"(i13.u21.P_8_7<1)")
Compilation finished in 1296 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15860210073118595102]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[](!(LTLAPp0==true))||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15860210073118595102]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.246: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.246: LTL layer: formula: X(((LTLAPp0==true)||[](!(LTLAPp0==true))||<>((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.246: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.247: "X(((LTLAPp0==true)||[](!(LTLAPp0==true))||<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.245: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.249: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.249: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.253: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.261: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.266: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.364: DFS-FIFO for weak LTL, using special progress label 228
pins2lts-mc-linux64( 0/ 8), 0.364: There are 229 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.364: State length is 116, there are 230 groups
pins2lts-mc-linux64( 0/ 8), 0.364: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.364: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.364: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.364: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.695: ~1 levels ~960 states ~29504 transitions
pins2lts-mc-linux64( 2/ 8), 0.781: ~1 levels ~1920 states ~128656 transitions
pins2lts-mc-linux64( 2/ 8), 0.958: ~1 levels ~3840 states ~325776 transitions
pins2lts-mc-linux64( 2/ 8), 1.214: ~1 levels ~7680 states ~628832 transitions
pins2lts-mc-linux64( 2/ 8), 1.712: ~1 levels ~15360 states ~1220664 transitions
pins2lts-mc-linux64( 2/ 8), 2.721: ~1 levels ~30720 states ~2419408 transitions
pins2lts-mc-linux64( 7/ 8), 4.836: ~1 levels ~61440 states ~4943944 transitions
pins2lts-mc-linux64( 3/ 8), 8.805: ~1 levels ~122880 states ~9530936 transitions
pins2lts-mc-linux64( 2/ 8), 16.576: ~1 levels ~245760 states ~18195712 transitions
pins2lts-mc-linux64( 2/ 8), 29.326: ~1 levels ~491520 states ~32398224 transitions
pins2lts-mc-linux64( 2/ 8), 54.316: ~1 levels ~983040 states ~60942928 transitions
pins2lts-mc-linux64( 7/ 8), 64.490: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 65.030:
pins2lts-mc-linux64( 0/ 8), 65.030: mean standard work distribution: 5.8% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 65.030:
pins2lts-mc-linux64( 0/ 8), 65.030: Explored 1070223 states 69590575 transitions, fanout: 65.024
pins2lts-mc-linux64( 0/ 8), 65.030: Total exploration time 64.650 sec (64.140 sec minimum, 64.365 sec on average)
pins2lts-mc-linux64( 0/ 8), 65.030: States per second: 16554, Transitions per second: 1076420
pins2lts-mc-linux64( 0/ 8), 65.030:
pins2lts-mc-linux64( 0/ 8), 65.030: Progress states detected: 23879706
pins2lts-mc-linux64( 0/ 8), 65.031: Redundant explorations: -95.5184
pins2lts-mc-linux64( 0/ 8), 65.031:
pins2lts-mc-linux64( 0/ 8), 65.031: Queue width: 8B, total height: 30254160, memory: 230.82MB
pins2lts-mc-linux64( 0/ 8), 65.031: Tree memory: 438.2MB, 19.2 B/state, compr.: 4.1%
pins2lts-mc-linux64( 0/ 8), 65.031: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 65.031: Stored 265 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 65.031: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 65.031: Est. total memory use: 669.0MB (~1254.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[](!(LTLAPp0==true))||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15860210073118595102]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[](!(LTLAPp0==true))||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15860210073118595102]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 15:54:12] [INFO ] Flatten gal took : 14 ms
[2021-05-13 15:54:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality13983584386597461742.gal : 2 ms
[2021-05-13 15:54:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality3446038703041879839.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/LTLCardinality13983584386597461742.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3446038703041879839.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/LTLCardinality13983584386597461742.gal -t CGAL -LTL /tmp/LTLCardinality3446038703041879839.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(P_7_8>=1)")||(G("(P_7_8<1)")))||(F("(P_8_7<1)")))))
Formula 0 simplified : !X("(P_7_8>=1)" | G"(P_7_8<1)" | F"(P_8_7<1)")
Detected timeout of ITS tools.
[2021-05-13 16:14:53] [INFO ] Flatten gal took : 181 ms
[2021-05-13 16:14:53] [INFO ] Input system was already deterministic with 225 transitions.
[2021-05-13 16:14:54] [INFO ] Transformed 115 places.
[2021-05-13 16:14:54] [INFO ] Transformed 225 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-13 16:14:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality288543934074082491.gal : 5 ms
[2021-05-13 16:14:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality11798413897747062714.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/LTLCardinality288543934074082491.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11798413897747062714.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/LTLCardinality288543934074082491.gal -t CGAL -LTL /tmp/LTLCardinality11798413897747062714.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("(P_7_8>=1)")||(G("(P_7_8<1)")))||(F("(P_8_7<1)")))))
Formula 0 simplified : !X("(P_7_8>=1)" | G"(P_7_8<1)" | F"(P_8_7<1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="NQueens-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127200044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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