fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124155800028
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CANConstruction-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9557.636 899196.00 2746964.00 6179.40 FFTFTFFFFTTFFFFF 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-162124155800028.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 CANConstruction-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 29K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.3M 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 CANConstruction-PT-030-00
FORMULA_NAME CANConstruction-PT-030-01
FORMULA_NAME CANConstruction-PT-030-02
FORMULA_NAME CANConstruction-PT-030-03
FORMULA_NAME CANConstruction-PT-030-04
FORMULA_NAME CANConstruction-PT-030-05
FORMULA_NAME CANConstruction-PT-030-06
FORMULA_NAME CANConstruction-PT-030-07
FORMULA_NAME CANConstruction-PT-030-08
FORMULA_NAME CANConstruction-PT-030-09
FORMULA_NAME CANConstruction-PT-030-10
FORMULA_NAME CANConstruction-PT-030-11
FORMULA_NAME CANConstruction-PT-030-12
FORMULA_NAME CANConstruction-PT-030-13
FORMULA_NAME CANConstruction-PT-030-14
FORMULA_NAME CANConstruction-PT-030-15

=== Now, execution of the tool begins

BK_START 1621246551543

Running Version 0
[2021-05-17 10:15:53] [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-17 10:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 10:15:53] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2021-05-17 10:15:53] [INFO ] Transformed 2162 places.
[2021-05-17 10:15:53] [INFO ] Transformed 3840 transitions.
[2021-05-17 10:15:53] [INFO ] Parsed PT model containing 2162 places and 3840 transitions in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 10:15:53] [INFO ] Initial state test concluded for 2 properties.
FORMULA CANConstruction-PT-030-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 824 places :
Symmetric choice reduction at 0 with 824 rule applications. Total rules 824 place count 1338 transition count 2192
Iterating global reduction 0 with 824 rules applied. Total rules applied 1648 place count 1338 transition count 2192
Applied a total of 1648 rules in 336 ms. Remains 1338 /2162 variables (removed 824) and now considering 2192/3840 (removed 1648) transitions.
// Phase 1: matrix 2192 rows 1338 cols
[2021-05-17 10:15:54] [INFO ] Computed 61 place invariants in 54 ms
[2021-05-17 10:15:55] [INFO ] Implicit Places using invariants in 855 ms returned [12, 26, 40, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 889 ms to find 29 implicit places.
// Phase 1: matrix 2192 rows 1309 cols
[2021-05-17 10:15:55] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-17 10:15:55] [INFO ] Dead Transitions using invariants and state equation in 932 ms returned []
Starting structural reductions, iteration 1 : 1309/2162 places, 2192/3840 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1281 transition count 2164
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1281 transition count 2164
Applied a total of 56 rules in 196 ms. Remains 1281 /1309 variables (removed 28) and now considering 2164/2192 (removed 28) transitions.
// Phase 1: matrix 2164 rows 1281 cols
[2021-05-17 10:15:56] [INFO ] Computed 32 place invariants in 12 ms
[2021-05-17 10:15:56] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 2164 rows 1281 cols
[2021-05-17 10:15:56] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-17 10:15:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:16:08] [INFO ] Implicit Places using invariants and state equation in 12175 ms returned []
Implicit Place search using SMT with State Equation took 12744 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1281/2162 places, 2164/3840 transitions.
[2021-05-17 10:16:10] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 10:16:10] [INFO ] Flatten gal took : 188 ms
FORMULA CANConstruction-PT-030-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 10:16:10] [INFO ] Flatten gal took : 115 ms
[2021-05-17 10:16:10] [INFO ] Input system was already deterministic with 2164 transitions.
Incomplete random walk after 100000 steps, including 188 resets, run finished after 635 ms. (steps per millisecond=157 ) properties (out of 21) seen :16
Running SMT prover for 5 properties.
// Phase 1: matrix 2164 rows 1281 cols
[2021-05-17 10:16:11] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-17 10:16:11] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-17 10:16:11] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned unsat
[2021-05-17 10:16:11] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned unsat
[2021-05-17 10:16:12] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned unsat
[2021-05-17 10:16:12] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
[2021-05-17 10:16:12] [INFO ] Initial state test concluded for 2 properties.
FORMULA CANConstruction-PT-030-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1281 transition count 1965
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1082 transition count 1965
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 398 place count 1082 transition count 1936
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 456 place count 1053 transition count 1936
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 471 place count 1038 transition count 1906
Iterating global reduction 2 with 15 rules applied. Total rules applied 486 place count 1038 transition count 1906
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 498 place count 1038 transition count 1894
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 510 place count 1026 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 570 place count 996 transition count 1864
Applied a total of 570 rules in 425 ms. Remains 996 /1281 variables (removed 285) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 996 cols
[2021-05-17 10:16:12] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 10:16:13] [INFO ] Implicit Places using invariants in 513 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 517 ms to find 1 implicit places.
[2021-05-17 10:16:13] [INFO ] Redundant transitions in 110 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:16:13] [INFO ] Computed 31 place invariants in 15 ms
[2021-05-17 10:16:14] [INFO ] Dead Transitions using invariants and state equation in 821 ms returned []
Starting structural reductions, iteration 1 : 995/1281 places, 1864/2164 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 995 transition count 1862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 993 transition count 1862
Applied a total of 4 rules in 96 ms. Remains 993 /995 variables (removed 2) and now considering 1862/1864 (removed 2) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2021-05-17 10:16:14] [INFO ] Computed 31 place invariants in 37 ms
[2021-05-17 10:16:14] [INFO ] Implicit Places using invariants in 614 ms returned []
// Phase 1: matrix 1862 rows 993 cols
[2021-05-17 10:16:14] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-17 10:16:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:16:24] [INFO ] Implicit Places using invariants and state equation in 9797 ms returned []
Implicit Place search using SMT with State Equation took 10413 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 993/1281 places, 1862/2164 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s675)], 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 225 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-030-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-01 finished in 12636 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 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1281 transition count 1965
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1082 transition count 1965
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 398 place count 1082 transition count 1936
Deduced a syphon composed of 29 places in 15 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 456 place count 1053 transition count 1936
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 471 place count 1038 transition count 1906
Iterating global reduction 2 with 15 rules applied. Total rules applied 486 place count 1038 transition count 1906
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 498 place count 1038 transition count 1894
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 510 place count 1026 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 570 place count 996 transition count 1864
Applied a total of 570 rules in 329 ms. Remains 996 /1281 variables (removed 285) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 996 cols
[2021-05-17 10:16:25] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-17 10:16:25] [INFO ] Implicit Places using invariants in 542 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 ms to find 1 implicit places.
[2021-05-17 10:16:25] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:16:25] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:16:26] [INFO ] Dead Transitions using invariants and state equation in 751 ms returned []
Starting structural reductions, iteration 1 : 995/1281 places, 1864/2164 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 995 transition count 1862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 993 transition count 1862
Applied a total of 4 rules in 75 ms. Remains 993 /995 variables (removed 2) and now considering 1862/1864 (removed 2) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2021-05-17 10:16:26] [INFO ] Computed 31 place invariants in 17 ms
[2021-05-17 10:16:27] [INFO ] Implicit Places using invariants in 542 ms returned []
// Phase 1: matrix 1862 rows 993 cols
[2021-05-17 10:16:27] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:16:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:16:37] [INFO ] Implicit Places using invariants and state equation in 10450 ms returned []
Implicit Place search using SMT with State Equation took 10993 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 993/1281 places, 1862/2164 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-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:(LEQ s366 s365)], 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 497 reset in 708 ms.
Product exploration explored 100000 steps with 498 reset in 705 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 503 reset in 625 ms.
Product exploration explored 100000 steps with 498 reset in 657 ms.
[2021-05-17 10:16:40] [INFO ] Flatten gal took : 72 ms
[2021-05-17 10:16:40] [INFO ] Flatten gal took : 72 ms
[2021-05-17 10:16:40] [INFO ] Time to serialize gal into /tmp/LTL5992573224128400532.gal : 21 ms
[2021-05-17 10:16:40] [INFO ] Time to serialize properties into /tmp/LTL9952384489682525340.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/LTL5992573224128400532.gal, -t, CGAL, -LTL, /tmp/LTL9952384489682525340.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/LTL5992573224128400532.gal -t CGAL -LTL /tmp/LTL9952384489682525340.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node8GiveAnswer12<=Node8requestsent12)"))))
Formula 0 simplified : !GF"(Node8GiveAnswer12<=Node8requestsent12)"
Detected timeout of ITS tools.
[2021-05-17 10:16:55] [INFO ] Flatten gal took : 72 ms
[2021-05-17 10:16:55] [INFO ] Applying decomposition
[2021-05-17 10:16:55] [INFO ] Flatten gal took : 82 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/graph500486328007577867.txt, -o, /tmp/graph500486328007577867.bin, -w, /tmp/graph500486328007577867.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/graph500486328007577867.bin, -l, -1, -v, -w, /tmp/graph500486328007577867.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:16:56] [INFO ] Decomposing Gal with order
[2021-05-17 10:16:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:16:56] [INFO ] Removed a total of 1770 redundant transitions.
[2021-05-17 10:16:56] [INFO ] Flatten gal took : 345 ms
[2021-05-17 10:16:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1676 labels/synchronizations in 115 ms.
[2021-05-17 10:16:56] [INFO ] Time to serialize gal into /tmp/LTL6353638723735756705.gal : 11 ms
[2021-05-17 10:16:56] [INFO ] Time to serialize properties into /tmp/LTL8252466586027065601.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/LTL6353638723735756705.gal, -t, CGAL, -LTL, /tmp/LTL8252466586027065601.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/LTL6353638723735756705.gal -t CGAL -LTL /tmp/LTL8252466586027065601.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu31.Node8GiveAnswer12<=gu31.Node8requestsent12)"))))
Formula 0 simplified : !GF"(gu31.Node8GiveAnswer12<=gu31.Node8requestsent12)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8207982647794873489
[2021-05-17 10:17:11] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8207982647794873489
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/ltsmin8207982647794873489]
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/ltsmin8207982647794873489] 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/ltsmin8207982647794873489] 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 CANConstruction-PT-030-03 finished in 48065 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&X((p1&&X(p1)&&F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1265 transition count 2133
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1265 transition count 2133
Applied a total of 32 rules in 217 ms. Remains 1265 /1281 variables (removed 16) and now considering 2133/2164 (removed 31) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:17:13] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:17:13] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:17:13] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-17 10:17:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:17:30] [INFO ] Implicit Places using invariants and state equation in 16975 ms returned []
Implicit Place search using SMT with State Equation took 17554 ms to find 0 implicit places.
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:17:30] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:17:31] [INFO ] Dead Transitions using invariants and state equation in 889 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1265/1281 places, 2133/2164 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), p0]
Running random walk in product with property : CANConstruction-PT-030-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s132 s48), p1:(GT s141 s722)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2112 steps with 30 reset in 14 ms.
FORMULA CANConstruction-PT-030-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-05 finished in 18910 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1281 transition count 1967
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1084 transition count 1967
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 394 place count 1084 transition count 1938
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 452 place count 1055 transition count 1938
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 467 place count 1040 transition count 1908
Iterating global reduction 2 with 15 rules applied. Total rules applied 482 place count 1040 transition count 1908
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 493 place count 1040 transition count 1897
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 504 place count 1029 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 566 place count 998 transition count 1866
Applied a total of 566 rules in 189 ms. Remains 998 /1281 variables (removed 283) and now considering 1866/2164 (removed 298) transitions.
// Phase 1: matrix 1866 rows 998 cols
[2021-05-17 10:17:32] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-17 10:17:32] [INFO ] Implicit Places using invariants in 563 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 565 ms to find 1 implicit places.
[2021-05-17 10:17:32] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 1866 rows 997 cols
[2021-05-17 10:17:32] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:17:33] [INFO ] Dead Transitions using invariants and state equation in 838 ms returned []
Starting structural reductions, iteration 1 : 997/1281 places, 1866/2164 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 997 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 995 transition count 1864
Applied a total of 4 rules in 68 ms. Remains 995 /997 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:17:33] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:17:34] [INFO ] Implicit Places using invariants in 620 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:17:34] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-17 10:17:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:17:43] [INFO ] Implicit Places using invariants and state equation in 9805 ms returned []
Implicit Place search using SMT with State Equation took 10432 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/1281 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-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}]], initial=1, aps=[p0:(LEQ s863 s43)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4720 steps with 22 reset in 29 ms.
FORMULA CANConstruction-PT-030-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-06 finished in 12262 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 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1281 transition count 1965
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1082 transition count 1965
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 398 place count 1082 transition count 1936
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 456 place count 1053 transition count 1936
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 471 place count 1038 transition count 1906
Iterating global reduction 2 with 15 rules applied. Total rules applied 486 place count 1038 transition count 1906
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 498 place count 1038 transition count 1894
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 510 place count 1026 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 570 place count 996 transition count 1864
Applied a total of 570 rules in 162 ms. Remains 996 /1281 variables (removed 285) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 996 cols
[2021-05-17 10:17:44] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-17 10:17:44] [INFO ] Implicit Places using invariants in 637 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 640 ms to find 1 implicit places.
[2021-05-17 10:17:44] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:17:44] [INFO ] Computed 31 place invariants in 23 ms
[2021-05-17 10:17:45] [INFO ] Dead Transitions using invariants and state equation in 823 ms returned []
Starting structural reductions, iteration 1 : 995/1281 places, 1864/2164 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 995 transition count 1862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 993 transition count 1862
Applied a total of 4 rules in 58 ms. Remains 993 /995 variables (removed 2) and now considering 1862/1864 (removed 2) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2021-05-17 10:17:45] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:17:46] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 1862 rows 993 cols
[2021-05-17 10:17:46] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:17:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:17:57] [INFO ] Implicit Places using invariants and state equation in 11232 ms returned []
Implicit Place search using SMT with State Equation took 11748 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 993/1281 places, 1862/2164 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s719 s451)], 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 484 reset in 612 ms.
Stack based approach found an accepted trace after 24259 steps with 117 reset with depth 197 and stack size 195 in 162 ms.
FORMULA CANConstruction-PT-030-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-07 finished in 14306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1265 transition count 2133
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1265 transition count 2133
Applied a total of 32 rules in 115 ms. Remains 1265 /1281 variables (removed 16) and now considering 2133/2164 (removed 31) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:17:58] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:17:59] [INFO ] Implicit Places using invariants in 629 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 631 ms to find 1 implicit places.
// Phase 1: matrix 2133 rows 1264 cols
[2021-05-17 10:17:59] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:00] [INFO ] Dead Transitions using invariants and state equation in 927 ms returned []
Starting structural reductions, iteration 1 : 1264/1281 places, 2133/2164 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 109 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:18:00] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:00] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:18:00] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:01] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:18:13] [INFO ] Implicit Places using invariants and state equation in 13101 ms returned []
Implicit Place search using SMT with State Equation took 13663 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1263/1281 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s656 s573)], 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]]
Product exploration explored 100000 steps with 50000 reset in 1096 ms.
Product exploration explored 100000 steps with 50000 reset in 1093 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 989 ms.
Product exploration explored 100000 steps with 50000 reset in 1085 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1263 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1263/1263 places, 2132/2132 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1263 transition count 2132
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 120 place count 1263 transition count 2132
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 150 place count 1263 transition count 2132
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 210 place count 1203 transition count 2072
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 270 place count 1203 transition count 2072
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 390 place count 1203 transition count 2072
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 540 place count 1053 transition count 1922
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 690 place count 1053 transition count 1922
Deduced a syphon composed of 60 places in 1 ms
Applied a total of 690 rules in 486 ms. Remains 1053 /1263 variables (removed 210) and now considering 1922/2132 (removed 210) transitions.
[2021-05-17 10:18:20] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1922 rows 1053 cols
[2021-05-17 10:18:20] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:21] [INFO ] Dead Transitions using invariants and state equation in 805 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1053/1263 places, 1922/2132 transitions.
Product exploration explored 100000 steps with 50000 reset in 6313 ms.
Product exploration explored 100000 steps with 50000 reset in 6233 ms.
[2021-05-17 10:18:33] [INFO ] Flatten gal took : 142 ms
[2021-05-17 10:18:33] [INFO ] Flatten gal took : 130 ms
[2021-05-17 10:18:33] [INFO ] Time to serialize gal into /tmp/LTL5667873248798944638.gal : 9 ms
[2021-05-17 10:18:34] [INFO ] Time to serialize properties into /tmp/LTL6162456535194479150.ltl : 130 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/LTL5667873248798944638.gal, -t, CGAL, -LTL, /tmp/LTL6162456535194479150.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/LTL5667873248798944638.gal -t CGAL -LTL /tmp/LTL6162456535194479150.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Node9requestsent2<=Node6GiveAnswer7)"))))
Formula 0 simplified : !XF"(Node9requestsent2<=Node6GiveAnswer7)"
Detected timeout of ITS tools.
[2021-05-17 10:18:49] [INFO ] Flatten gal took : 75 ms
[2021-05-17 10:18:49] [INFO ] Applying decomposition
[2021-05-17 10:18:49] [INFO ] Flatten gal took : 129 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/graph10819828718805532102.txt, -o, /tmp/graph10819828718805532102.bin, -w, /tmp/graph10819828718805532102.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/graph10819828718805532102.bin, -l, -1, -v, -w, /tmp/graph10819828718805532102.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:18:49] [INFO ] Decomposing Gal with order
[2021-05-17 10:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:18:49] [INFO ] Removed a total of 1768 redundant transitions.
[2021-05-17 10:18:50] [INFO ] Flatten gal took : 422 ms
[2021-05-17 10:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1676 labels/synchronizations in 98 ms.
[2021-05-17 10:18:50] [INFO ] Time to serialize gal into /tmp/LTL3482571940504791021.gal : 24 ms
[2021-05-17 10:18:50] [INFO ] Time to serialize properties into /tmp/LTL15932831717503018578.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/LTL3482571940504791021.gal, -t, CGAL, -LTL, /tmp/LTL15932831717503018578.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/LTL3482571940504791021.gal -t CGAL -LTL /tmp/LTL15932831717503018578.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu134.Node9requestsent2<=gu134.Node6GiveAnswer7)"))))
Formula 0 simplified : !XF"(gu134.Node9requestsent2<=gu134.Node6GiveAnswer7)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18321115435795539888
[2021-05-17 10:19:05] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18321115435795539888
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/ltsmin18321115435795539888]
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/ltsmin18321115435795539888] 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/ltsmin18321115435795539888] 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 CANConstruction-PT-030-09 finished in 68178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1281 transition count 1965
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1082 transition count 1965
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 398 place count 1082 transition count 1936
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 456 place count 1053 transition count 1936
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 472 place count 1037 transition count 1904
Iterating global reduction 2 with 16 rules applied. Total rules applied 488 place count 1037 transition count 1904
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 501 place count 1037 transition count 1891
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 514 place count 1024 transition count 1891
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 572 place count 995 transition count 1862
Applied a total of 572 rules in 291 ms. Remains 995 /1281 variables (removed 286) and now considering 1862/2164 (removed 302) transitions.
// Phase 1: matrix 1862 rows 995 cols
[2021-05-17 10:19:06] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-17 10:19:07] [INFO ] Implicit Places using invariants in 648 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 650 ms to find 1 implicit places.
[2021-05-17 10:19:07] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 1862 rows 994 cols
[2021-05-17 10:19:07] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:19:08] [INFO ] Dead Transitions using invariants and state equation in 820 ms returned []
Starting structural reductions, iteration 1 : 994/1281 places, 1862/2164 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 994 transition count 1860
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 992 transition count 1860
Applied a total of 4 rules in 65 ms. Remains 992 /994 variables (removed 2) and now considering 1860/1862 (removed 2) transitions.
// Phase 1: matrix 1860 rows 992 cols
[2021-05-17 10:19:08] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-17 10:19:09] [INFO ] Implicit Places using invariants in 571 ms returned []
// Phase 1: matrix 1860 rows 992 cols
[2021-05-17 10:19:09] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:19:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:19:19] [INFO ] Implicit Places using invariants and state equation in 10862 ms returned []
Implicit Place search using SMT with State Equation took 11435 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 992/1281 places, 1860/2164 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s132)], 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 204 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-11 finished in 13374 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1265 transition count 2133
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1265 transition count 2133
Applied a total of 32 rules in 70 ms. Remains 1265 /1281 variables (removed 16) and now considering 2133/2164 (removed 31) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:19:20] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:19:20] [INFO ] Implicit Places using invariants in 591 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 602 ms to find 1 implicit places.
// Phase 1: matrix 2133 rows 1264 cols
[2021-05-17 10:19:20] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-17 10:19:21] [INFO ] Dead Transitions using invariants and state equation in 1016 ms returned []
Starting structural reductions, iteration 1 : 1264/1281 places, 2133/2164 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 70 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:19:21] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:19:22] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:19:22] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:19:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:19:34] [INFO ] Implicit Places using invariants and state equation in 12196 ms returned []
Implicit Place search using SMT with State Equation took 12824 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1263/1281 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s473 s1146)], 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 607 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-12 finished in 14664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1281 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1281/1281 places, 2164/2164 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1281 transition count 1967
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 1084 transition count 1966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 1083 transition count 1966
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 396 place count 1083 transition count 1938
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 452 place count 1055 transition count 1938
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 467 place count 1040 transition count 1908
Iterating global reduction 3 with 15 rules applied. Total rules applied 482 place count 1040 transition count 1908
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 494 place count 1040 transition count 1896
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 506 place count 1028 transition count 1896
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 566 place count 998 transition count 1866
Applied a total of 566 rules in 151 ms. Remains 998 /1281 variables (removed 283) and now considering 1866/2164 (removed 298) transitions.
// Phase 1: matrix 1866 rows 998 cols
[2021-05-17 10:19:34] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-17 10:19:35] [INFO ] Implicit Places using invariants in 532 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 535 ms to find 1 implicit places.
[2021-05-17 10:19:35] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1866 rows 997 cols
[2021-05-17 10:19:35] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:19:36] [INFO ] Dead Transitions using invariants and state equation in 798 ms returned []
Starting structural reductions, iteration 1 : 997/1281 places, 1866/2164 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 997 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 995 transition count 1864
Applied a total of 4 rules in 55 ms. Remains 995 /997 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:19:36] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:19:36] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:19:36] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:19:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:19:48] [INFO ] Implicit Places using invariants and state equation in 11897 ms returned []
Implicit Place search using SMT with State Equation took 12490 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/1281 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s531), p1:(GT s49 s912)], nbAcceptance=2, 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 225 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-14 finished in 14149 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin359896388654226327
[2021-05-17 10:19:48] [INFO ] Too many transitions (2164) to apply POR reductions. Disabling POR matrices.
[2021-05-17 10:19:48] [INFO ] Applying decomposition
[2021-05-17 10:19:48] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin359896388654226327
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/ltsmin359896388654226327]
[2021-05-17 10:19:48] [INFO ] Flatten gal took : 91 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/graph3683134791163424015.txt, -o, /tmp/graph3683134791163424015.bin, -w, /tmp/graph3683134791163424015.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/graph3683134791163424015.bin, -l, -1, -v, -w, /tmp/graph3683134791163424015.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:19:49] [INFO ] Decomposing Gal with order
[2021-05-17 10:19:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:19:49] [INFO ] Removed a total of 1800 redundant transitions.
[2021-05-17 10:19:49] [INFO ] Flatten gal took : 284 ms
[2021-05-17 10:19:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1666 labels/synchronizations in 44 ms.
[2021-05-17 10:19:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality12367828758503994190.gal : 14 ms
[2021-05-17 10:19:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality15496624477282182257.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/LTLCardinality12367828758503994190.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15496624477282182257.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/LTLCardinality12367828758503994190.gal -t CGAL -LTL /tmp/LTLCardinality15496624477282182257.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(F("(gu141.Node8GiveAnswer12<=gu141.Node8requestsent12)"))))
Formula 0 simplified : !GF"(gu141.Node8GiveAnswer12<=gu141.Node8requestsent12)"
Compilation finished in 18100 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin359896388654226327]
Link finished in 64 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin359896388654226327]
WARNING : LTSmin timed out (>300 s) on command 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin359896388654226327]
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(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin359896388654226327]
LTSmin run took 734 ms.
FORMULA CANConstruction-PT-030-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2400 s
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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin359896388654226327]
LTSmin run took 341820 ms.
FORMULA CANConstruction-PT-030-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621247450739

--------------------
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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r292-tall-162124155800028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 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 ;