fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r159-oct2-162089268300367
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for PolyORBNT-COL-S05J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11463.044 1564666.00 5258384.00 1311.50 FFTFFTTTTTFTFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300367.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S05J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.7K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S05J20-ReachabilityFireability-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621211331612

Running Version 0
[2021-05-17 00:28:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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 00:28:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:28:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 00:28:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 00:28:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 747 ms
[2021-05-17 00:28:54] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 00:28:54] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 00:28:54] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 00:28:54] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 00:28:54] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 00:28:54] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 00:28:54] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 5 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 00:28:54] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2021-05-17 00:28:54] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_11388562043927817161.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-17 00:28:54] [INFO ] Flatten gal took : 30 ms
[2021-05-17 00:28:54] [INFO ] Flatten gal took : 5 ms
[2021-05-17 00:28:54] [INFO ] Unfolded HLPN to a Petri net with 369 places and 575 transitions in 24 ms.
[2021-05-17 00:28:54] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7147815391959941097.dot
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 672 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 16) seen :11
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2021-05-17 00:28:55] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2021-05-17 00:28:55] [INFO ] Computed 62 place invariants in 35 ms
[2021-05-17 00:28:55] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2021-05-17 00:28:55] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned unsat
[2021-05-17 00:28:55] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-17 00:28:55] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:28:56] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-17 00:28:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:28:56] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-17 00:28:56] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:28:56] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-17 00:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:28:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2021-05-17 00:28:56] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 73 ms.
[2021-05-17 00:28:56] [INFO ] Added : 17 causal constraints over 4 iterations in 443 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-17 00:28:57] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2021-05-17 00:28:57] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned unsat
[2021-05-17 00:28:57] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-17 00:28:57] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-17 00:28:57] [INFO ] [Real]Absence check using 55 positive place invariants in 44 ms returned sat
[2021-05-17 00:28:57] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned unsat
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Incomplete Parikh walk after 3900 steps, including 177 resets, run finished after 18 ms. (steps per millisecond=216 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 118 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2021-05-17 00:28:57] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2021-05-17 00:28:57] [INFO ] Computed 57 place invariants in 16 ms
[2021-05-17 00:28:57] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned [260, 261, 262, 264, 267, 271, 276, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 323, 324, 325, 326, 327, 329, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 358, 359, 360, 361, 362, 364, 367, 368, 369, 370, 371, 372, 374, 377, 381, 382, 383, 384]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[384, 383, 382, 381, 377, 374, 372, 371, 370, 369, 368, 367, 364, 362, 361, 360, 359, 358, 356, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 344, 343, 342, 341, 340, 339, 338, 337, 336, 335, 334, 333, 332, 329, 327, 326, 325, 324, 323, 321, 320, 319, 318, 317, 316, 315, 314, 313, 312, 311, 310, 309, 308, 307, 306, 305, 304, 303, 301, 300, 299, 298, 297, 296, 295, 294, 293, 292, 291, 290, 289, 288, 287, 286, 285, 284, 283, 282, 276, 271, 267, 264, 262, 261, 260]
Starting structural reductions, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 290/349 places, 406/555 transitions.
[2021-05-17 00:28:57] [INFO ] Flatten gal took : 39 ms
[2021-05-17 00:28:57] [INFO ] Flatten gal took : 32 ms
[2021-05-17 00:28:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13580872614865182097.gal : 26 ms
[2021-05-17 00:28:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8162950299707262738.prop : 3 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13580872614865182097.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8162950299707262738.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13580872614865182097.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8162950299707262738.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8162950299707262738.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
Detected timeout of ITS tools.
[2021-05-17 00:29:13] [INFO ] Flatten gal took : 63 ms
[2021-05-17 00:29:13] [INFO ] Applying decomposition
[2021-05-17 00:29:13] [INFO ] Flatten gal took : 52 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/graph16417105172112924775.txt, -o, /tmp/graph16417105172112924775.bin, -w, /tmp/graph16417105172112924775.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/graph16417105172112924775.bin, -l, -1, -v, -w, /tmp/graph16417105172112924775.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:29:13] [INFO ] Decomposing Gal with order
[2021-05-17 00:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:29:13] [INFO ] Removed a total of 364 redundant transitions.
[2021-05-17 00:29:13] [INFO ] Flatten gal took : 83 ms
[2021-05-17 00:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 11 ms.
[2021-05-17 00:29:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2273653452033448589.gal : 6 ms
[2021-05-17 00:29:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9987705014966251108.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2273653452033448589.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9987705014966251108.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2273653452033448589.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9987705014966251108.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9987705014966251108.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 81
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :81 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 199555
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :199555 after 199555
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :199555 after 2.57806e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.57806e+06 after 2.01907e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11645988556990315145
[2021-05-17 00:29:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11645988556990315145
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/ltsmin11645988556990315145]
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/ltsmin11645988556990315145] 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/ltsmin11645988556990315145] 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)
Incomplete random walk after 1000000 steps, including 52073 resets, run finished after 2378 ms. (steps per millisecond=420 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7210 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13294205 steps, run timeout after 30001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 13294205 steps, saw 3810754 distinct states, run finished after 30008 ms. (steps per millisecond=443 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-17 00:30:02] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-17 00:30:02] [INFO ] Computed 57 place invariants in 13 ms
[2021-05-17 00:30:02] [INFO ] [Real]Absence check using 50 positive place invariants in 134 ms returned sat
[2021-05-17 00:30:02] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:03] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2021-05-17 00:30:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:30:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-17 00:30:03] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:03] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-17 00:30:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:30:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 1 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 1 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 13 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 1 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 0 ms to minimize.
[2021-05-17 00:30:04] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 1 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 1 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 7 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 92 places in 225 ms of which 0 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 1 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 1 ms to minimize.
[2021-05-17 00:30:05] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 1 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 1 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 1 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 0 ms to minimize.
[2021-05-17 00:30:06] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 86 places in 419 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 14 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 0 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 1 ms to minimize.
[2021-05-17 00:30:07] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 0 ms to minimize.
[2021-05-17 00:30:08] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 1 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2021-05-17 00:30:09] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2021-05-17 00:30:10] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 3 ms to minimize.
[2021-05-17 00:30:48] [INFO ] Deduced a trap composed of 2 places in 152 ms of which 1 ms to minimize.
[2021-05-17 00:30:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 24 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2021-05-17 00:30:48] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-17 00:30:48] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-17 00:30:49] [INFO ] Implicit Places using invariants in 329 ms returned []
[2021-05-17 00:30:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-17 00:30:49] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-17 00:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:30:49] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2021-05-17 00:30:49] [INFO ] Redundant transitions in 22 ms returned []
[2021-05-17 00:30:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-17 00:30:49] [INFO ] Computed 57 place invariants in 10 ms
[2021-05-17 00:30:53] [INFO ] Dead Transitions using invariants and state equation in 3594 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100002 steps, including 5278 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2021-05-17 00:30:53] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-17 00:30:53] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-17 00:30:53] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2021-05-17 00:30:53] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:53] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-17 00:30:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:30:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2021-05-17 00:30:54] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 00:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:30:54] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-17 00:30:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:30:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-17 00:30:54] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 21 ms to minimize.
[2021-05-17 00:30:54] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2021-05-17 00:30:54] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 0 ms to minimize.
[2021-05-17 00:30:54] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 0 ms to minimize.
[2021-05-17 00:30:54] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2021-05-17 00:30:55] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 95 places in 2031 ms of which 0 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 1 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 0 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 0 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 0 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 0 ms to minimize.
[2021-05-17 00:30:57] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 1 ms to minimize.
[2021-05-17 00:30:58] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 83 places in 1102 ms of which 1 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 1 ms to minimize.
[2021-05-17 00:30:59] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 1 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 1 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 0 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 8 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2021-05-17 00:31:00] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 1 ms to minimize.
[2021-05-17 00:31:01] [INFO ] Deduced a trap composed of 98 places in 295 ms of which 0 ms to minimize.
[2021-05-17 00:31:01] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 1 ms to minimize.
[2021-05-17 00:31:01] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 0 ms to minimize.
[2021-05-17 00:31:01] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 1 ms to minimize.
[2021-05-17 00:31:01] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 0 ms to minimize.
[2021-05-17 00:31:01] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 0 ms to minimize.
[2021-05-17 00:31:02] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 0 ms to minimize.
[2021-05-17 00:31:02] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 0 ms to minimize.
[2021-05-17 00:31:02] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2021-05-17 00:31:03] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 0 ms to minimize.
[2021-05-17 00:31:03] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 0 ms to minimize.
[2021-05-17 00:31:14] [INFO ] Deduced a trap composed of 2 places in 229 ms of which 9 ms to minimize.
[2021-05-17 00:31:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-17 00:31:14] [INFO ] Flatten gal took : 69 ms
[2021-05-17 00:31:14] [INFO ] Flatten gal took : 73 ms
[2021-05-17 00:31:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5380459735307640361.gal : 21 ms
[2021-05-17 00:31:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12821043119044405133.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5380459735307640361.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12821043119044405133.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5380459735307640361.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12821043119044405133.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12821043119044405133.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
Detected timeout of ITS tools.
[2021-05-17 00:31:29] [INFO ] Flatten gal took : 42 ms
[2021-05-17 00:31:29] [INFO ] Applying decomposition
[2021-05-17 00:31:29] [INFO ] Flatten gal took : 66 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/graph5775470095120824868.txt, -o, /tmp/graph5775470095120824868.bin, -w, /tmp/graph5775470095120824868.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/graph5775470095120824868.bin, -l, -1, -v, -w, /tmp/graph5775470095120824868.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:31:29] [INFO ] Decomposing Gal with order
[2021-05-17 00:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:31:29] [INFO ] Removed a total of 517 redundant transitions.
[2021-05-17 00:31:29] [INFO ] Flatten gal took : 81 ms
[2021-05-17 00:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 9 ms.
[2021-05-17 00:31:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8606934708702750658.gal : 4 ms
[2021-05-17 00:31:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2075736409118139139.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8606934708702750658.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2075736409118139139.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8606934708702750658.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2075736409118139139.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2075736409118139139.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10708839103016864065
[2021-05-17 00:31:44] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10708839103016864065
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/ltsmin10708839103016864065]
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/ltsmin10708839103016864065] 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/ltsmin10708839103016864065] 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)
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 75 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2021-05-17 00:31:45] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-17 00:31:46] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-17 00:31:46] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 00:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:31:46] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-17 00:31:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:31:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2021-05-17 00:31:46] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 00:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:31:46] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-17 00:31:46] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2021-05-17 00:31:46] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 0 ms to minimize.
[2021-05-17 00:31:46] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 1 ms to minimize.
[2021-05-17 00:31:46] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 0 ms to minimize.
[2021-05-17 00:31:46] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 0 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 99 places in 77 ms of which 13 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 0 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 0 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 0 ms to minimize.
[2021-05-17 00:31:47] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 1 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 0 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 0 ms to minimize.
[2021-05-17 00:31:48] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2021-05-17 00:31:49] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 0 ms to minimize.
[2021-05-17 00:31:49] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 1 ms to minimize.
[2021-05-17 00:31:49] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 0 ms to minimize.
[2021-05-17 00:31:49] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 0 ms to minimize.
[2021-05-17 00:31:49] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2021-05-17 00:31:49] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2021-05-17 00:31:50] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:31:50] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2021-05-17 00:31:50] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2021-05-17 00:31:50] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 1 ms to minimize.
[2021-05-17 00:31:50] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 0 ms to minimize.
[2021-05-17 00:31:50] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2021-05-17 00:31:51] [INFO ] Deduced a trap composed of 90 places in 1132 ms of which 0 ms to minimize.
[2021-05-17 00:31:51] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2021-05-17 00:31:52] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2021-05-17 00:31:52] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2021-05-17 00:31:52] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 1 ms to minimize.
[2021-05-17 00:31:52] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2021-05-17 00:31:53] [INFO ] Deduced a trap composed of 87 places in 718 ms of which 0 ms to minimize.
[2021-05-17 00:31:54] [INFO ] Deduced a trap composed of 81 places in 1056 ms of which 0 ms to minimize.
[2021-05-17 00:31:56] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2021-05-17 00:32:31] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 1 ms to minimize.
[2021-05-17 00:32:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-17 00:32:31] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
[2021-05-17 00:32:31] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin10071170604951988490
[2021-05-17 00:32:31] [INFO ] Flatten gal took : 34 ms
[2021-05-17 00:32:31] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2021-05-17 00:32:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 00:32:31] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2021-05-17 00:32:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 00:32:31] [INFO ] Flatten gal took : 48 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/graph15797732175386381803.txt, -o, /tmp/graph15797732175386381803.bin, -w, /tmp/graph15797732175386381803.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/graph15797732175386381803.bin, -l, -1, -v, -w, /tmp/graph15797732175386381803.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:32:31] [INFO ] Decomposing Gal with order
[2021-05-17 00:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:32:31] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2021-05-17 00:32:31] [INFO ] Input system was already deterministic with 406 transitions.
[2021-05-17 00:32:31] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 00:32:31] [INFO ] Removed a total of 364 redundant transitions.
[2021-05-17 00:32:31] [INFO ] Flatten gal took : 65 ms
[2021-05-17 00:32:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 7 ms.
[2021-05-17 00:32:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14781717714953527149.gal : 4 ms
[2021-05-17 00:32:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3958551818244104770.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability14781717714953527149.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability3958551818244104770.prop, --nowitness], workingDir=/home/mcc/execution]
[2021-05-17 00:32:31] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10071170604951988490
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/ltsmin10071170604951988490]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability14781717714953527149.gal -t CGAL -reachable-file /tmp/ReachabilityFireability3958551818244104770.prop --nowitness
Loading property file /tmp/ReachabilityFireability3958551818244104770.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
[2021-05-17 00:32:31] [INFO ] Ran tautology test, simplified 0 / 1 in 422 ms.
[2021-05-17 00:32:31] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=0 took 4 ms
[2021-05-17 00:32:31] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=1 took 15 ms
[2021-05-17 00:32:32] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=2 took 212 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2021-05-17 00:32:32] [INFO ] Computed 57 place invariants in 4 ms
inv : mi3_0 + mi2_0 + mi1_0 = 1
inv : FetchJobE_20 + QueueJobB_20 + f3_20 + f2_20 + f1_20 + NotifyEventJobQueuedB_20 + AvailableJobId_20 = 1
inv : CreatedJobs_65 + CreatedJobs_66 + CreatedJobs_67 + CreatedJobs_68 + CreatedJobs_69 + AvailableJobId_13 = 1
inv : FetchJobE_9 + QueueJobB_9 + f3_9 + f2_9 + f1_9 + NotifyEventJobQueuedB_9 + AvailableJobId_9 = 1
inv : CreatedJobs_60 + CreatedJobs_61 + CreatedJobs_62 + CreatedJobs_63 + CreatedJobs_64 + AvailableJobId_12 = 1
inv : CreatedJobs_70 + CreatedJobs_71 + CreatedJobs_72 + CreatedJobs_73 + CreatedJobs_74 + AvailableJobId_14 = 1
inv : FetchJobE_1 + QueueJobB_1 + f3_1 + f2_1 + f1_1 + NotifyEventJobQueuedB_1 + AvailableJobId_1 = 1
inv : FetchJobE_12 + QueueJobB_12 + f3_12 + f2_12 + f1_12 + NotifyEventJobQueuedB_12 + AvailableJobId_12 = 1
inv : ModifiedSrc_0 - CreatedJobs_1 - CreatedJobs_2 - CreatedJobs_3 - CreatedJobs_4 - CreatedJobs_6 - CreatedJobs_7 - CreatedJobs_8 - CreatedJobs_9 - CreatedJobs_11 - CreatedJobs_12 - CreatedJobs_13 - CreatedJobs_14 - CreatedJobs_16 - CreatedJobs_17 - CreatedJobs_18 - CreatedJobs_19 - CreatedJobs_21 - CreatedJobs_22 - CreatedJobs_23 - CreatedJobs_24 - CreatedJobs_26 - CreatedJobs_27 - CreatedJobs_28 - CreatedJobs_29 - CreatedJobs_31 - CreatedJobs_32 - CreatedJobs_33 - CreatedJobs_34 - CreatedJobs_36 - CreatedJobs_37 - CreatedJobs_38 - CreatedJobs_39 - CreatedJobs_41 - CreatedJobs_42 - CreatedJobs_43 - CreatedJobs_44 - CreatedJobs_46 - CreatedJobs_47 - CreatedJobs_48 - CreatedJobs_49 - CreatedJobs_51 - CreatedJobs_52 - CreatedJobs_53 - CreatedJobs_54 - CreatedJobs_56 - CreatedJobs_57 - CreatedJobs_58 - CreatedJobs_59 - CreatedJobs_61 - CreatedJobs_62 - CreatedJobs_63 - CreatedJobs_64 - CreatedJobs_66 - CreatedJobs_67 - CreatedJobs_68 - CreatedJobs_69 - CreatedJobs_71 - CreatedJobs_72 - CreatedJobs_73 - CreatedJobs_74 - CreatedJobs_76 - CreatedJobs_77 - CreatedJobs_78 - CreatedJobs_79 - CreatedJobs_81 - CreatedJobs_82 - CreatedJobs_83 - CreatedJobs_84 - CreatedJobs_86 - CreatedJobs_87 - CreatedJobs_88 - CreatedJobs_89 - CreatedJobs_91 - CreatedJobs_92 - CreatedJobs_93 - CreatedJobs_94 - CreatedJobs_96 - CreatedJobs_97 - CreatedJobs_98 - CreatedJobs_99 - CreatedJobs_101 - CreatedJobs_102 - CreatedJobs_103 - CreatedJobs_104 + place_482_0 - AvailableJobId_0 - AvailableJobId_1 - AvailableJobId_2 - AvailableJobId_3 - AvailableJobId_4 - AvailableJobId_5 - AvailableJobId_6 - AvailableJobId_7 - AvailableJobId_8 - AvailableJobId_9 - AvailableJobId_10 - AvailableJobId_11 - AvailableJobId_12 - AvailableJobId_13 - AvailableJobId_14 - AvailableJobId_15 - AvailableJobId_16 - AvailableJobId_17 - AvailableJobId_18 - AvailableJobId_19 - AvailableJobId_20 + TheSour_0 = -20
inv : FetchJobE_4 + QueueJobB_4 + f3_4 + f2_4 + f1_4 + NotifyEventJobQueuedB_4 + AvailableJobId_4 = 1
inv : FetchJobE_17 + QueueJobB_17 + f3_17 + f2_17 + f1_17 + NotifyEventJobQueuedB_17 + AvailableJobId_17 = 1
inv : ModifiedSrc_3 + CreatedJobs_3 + CreatedJobs_8 + CreatedJobs_13 + CreatedJobs_18 + CreatedJobs_23 + CreatedJobs_28 + CreatedJobs_33 + CreatedJobs_38 + CreatedJobs_43 + CreatedJobs_48 + CreatedJobs_53 + CreatedJobs_58 + CreatedJobs_63 + CreatedJobs_68 + CreatedJobs_73 + CreatedJobs_78 + CreatedJobs_83 + CreatedJobs_88 + CreatedJobs_93 + CreatedJobs_98 + CreatedJobs_103 + place_482_3 + TheSour_3 = 1
inv : CreatedJobs_45 + CreatedJobs_46 + CreatedJobs_47 + CreatedJobs_48 + CreatedJobs_49 + AvailableJobId_9 = 1
inv : FetchJobE_18 + QueueJobB_18 + f3_18 + f2_18 + f1_18 + NotifyEventJobQueuedB_18 + AvailableJobId_18 = 1
inv : ModifiedSrc_4 + CreatedJobs_4 + CreatedJobs_9 + CreatedJobs_14 + CreatedJobs_19 + CreatedJobs_24 + CreatedJobs_29 + CreatedJobs_34 + CreatedJobs_39 + CreatedJobs_44 + CreatedJobs_49 + CreatedJobs_54 + CreatedJobs_59 + CreatedJobs_64 + CreatedJobs_69 + CreatedJobs_74 + CreatedJobs_79 + CreatedJobs_84 + CreatedJobs_89 + CreatedJobs_94 + CreatedJobs_99 + CreatedJobs_104 + place_482_4 + TheSour_4 = 1
inv : CreatedJobs_15 + CreatedJobs_16 + CreatedJobs_17 + CreatedJobs_18 + CreatedJobs_19 + AvailableJobId_3 = 1
inv : FetchJobE_11 + QueueJobB_11 + f3_11 + f2_11 + f1_11 + NotifyEventJobQueuedB_11 + AvailableJobId_11 = 1
inv : FetchJobE_3 + QueueJobB_3 + f3_3 + f2_3 + f1_3 + NotifyEventJobQueuedB_3 + AvailableJobId_3 = 1
inv : CreatedJobs_85 + CreatedJobs_86 + CreatedJobs_87 + CreatedJobs_88 + CreatedJobs_89 + AvailableJobId_17 = 1
inv : FetchJobE_10 + QueueJobB_10 + f3_10 + f2_10 + f1_10 + NotifyEventJobQueuedB_10 + AvailableJobId_10 = 1
inv : CreatedJobs_55 + CreatedJobs_56 + CreatedJobs_57 + CreatedJobs_58 + CreatedJobs_59 + AvailableJobId_11 = 1
inv : CreatedJobs_75 + CreatedJobs_76 + CreatedJobs_77 + CreatedJobs_78 + CreatedJobs_79 + AvailableJobId_15 = 1
inv : CreatedJobs_5 + CreatedJobs_6 + CreatedJobs_7 + CreatedJobs_8 + CreatedJobs_9 + AvailableJobId_1 = 1
inv : FetchJobE_19 + QueueJobB_19 + f3_19 + f2_19 + f1_19 + NotifyEventJobQueuedB_19 + AvailableJobId_19 = 1
inv : CreatedJobs_35 + CreatedJobs_36 + CreatedJobs_37 + CreatedJobs_38 + CreatedJobs_39 + AvailableJobId_7 = 1
inv : FetchJobE_2 + QueueJobB_2 + f3_2 + f2_2 + f1_2 + NotifyEventJobQueuedB_2 + AvailableJobId_2 = 1
inv : mo2_0 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + mi3_0 + mi1_0 = 1
inv : CreatedJobs_100 + CreatedJobs_101 + CreatedJobs_102 + CreatedJobs_103 + CreatedJobs_104 + AvailableJobId_20 = 1
inv : CreatedJobs_30 + CreatedJobs_31 + CreatedJobs_32 + CreatedJobs_33 + CreatedJobs_34 + AvailableJobId_6 = 1
inv : 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 + 12*Check_Sources_E_0 + 12*CanInjectEvent_0 = 12
inv : FetchJobE_13 + QueueJobB_13 + f3_13 + f2_13 + f1_13 + NotifyEventJobQueuedB_13 + AvailableJobId_13 = 1
inv : ModifiedSrc_1 + CreatedJobs_1 + CreatedJobs_6 + CreatedJobs_11 + CreatedJobs_16 + CreatedJobs_21 + CreatedJobs_26 + CreatedJobs_31 + CreatedJobs_36 + CreatedJobs_41 + CreatedJobs_46 + CreatedJobs_51 + CreatedJobs_56 + CreatedJobs_61 + CreatedJobs_66 + CreatedJobs_71 + CreatedJobs_76 + CreatedJobs_81 + CreatedJobs_86 + CreatedJobs_91 + CreatedJobs_96 + CreatedJobs_101 + place_482_1 + TheSour_1 = 1
inv : -12*NotifyEventJobQueuedB_0 - 12*NotifyEventJobQueuedB_1 - 12*NotifyEventJobQueuedB_2 - 12*NotifyEventJobQueuedB_3 - 12*NotifyEventJobQueuedB_4 - 12*NotifyEventJobQueuedB_5 - 12*NotifyEventJobQueuedB_6 - 12*NotifyEventJobQueuedB_7 - 12*NotifyEventJobQueuedB_8 - 12*NotifyEventJobQueuedB_9 - 12*NotifyEventJobQueuedB_10 - 12*NotifyEventJobQueuedB_11 - 12*NotifyEventJobQueuedB_12 - 12*NotifyEventJobQueuedB_13 - 12*NotifyEventJobQueuedB_14 - 12*NotifyEventJobQueuedB_15 - 12*NotifyEventJobQueuedB_16 - 12*NotifyEventJobQueuedB_17 - 12*NotifyEventJobQueuedB_18 - 12*NotifyEventJobQueuedB_19 - 12*NotifyEventJobQueuedB_20 + 3*place_523_0 + 4*place_522_0 + 6*place_521_0 + 3*place_462_0 + 4*place_460_0 + 6*place_458_0 + 12*place_456_0 - 12*AvailableJobId_0 - 12*AvailableJobId_1 - 12*AvailableJobId_2 - 12*AvailableJobId_3 - 12*AvailableJobId_4 - 12*AvailableJobId_5 - 12*AvailableJobId_6 - 12*AvailableJobId_7 - 12*AvailableJobId_8 - 12*AvailableJobId_9 - 12*AvailableJobId_10 - 12*AvailableJobId_11 - 12*AvailableJobId_12 - 12*AvailableJobId_13 - 12*AvailableJobId_14 - 12*AvailableJobId_15 - 12*AvailableJobId_16 - 12*AvailableJobId_17 - 12*AvailableJobId_18 - 12*AvailableJobId_19 - 12*AvailableJobId_20 + 12*Check_Sources_E_0 + 12*place_787_0 + 12*Schedule_Task_B_0 + 12*cJobCnt_0 = -120
inv : CreatedJobs_25 + CreatedJobs_26 + CreatedJobs_27 + CreatedJobs_28 + CreatedJobs_29 + AvailableJobId_5 = 1
inv : FetchJobE_5 + QueueJobB_5 + f3_5 + f2_5 + f1_5 + NotifyEventJobQueuedB_5 + AvailableJobId_5 = 1
inv : FetchJobE_16 + QueueJobB_16 + f3_16 + f2_16 + f1_16 + NotifyEventJobQueuedB_16 + AvailableJobId_16 = 1
inv : CreatedJobs_95 + CreatedJobs_96 + CreatedJobs_97 + CreatedJobs_98 + CreatedJobs_99 + AvailableJobId_19 = 1
inv : FetchJobE_8 + QueueJobB_8 + f3_8 + f2_8 + f1_8 + NotifyEventJobQueuedB_8 + AvailableJobId_8 = 1
inv : -f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 + mo3_0 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 - mi3_0 = 0
inv : ModifiedSrc_2 + CreatedJobs_2 + CreatedJobs_7 + CreatedJobs_12 + CreatedJobs_17 + CreatedJobs_22 + CreatedJobs_27 + CreatedJobs_32 + CreatedJobs_37 + CreatedJobs_42 + CreatedJobs_47 + CreatedJobs_52 + CreatedJobs_57 + CreatedJobs_62 + CreatedJobs_67 + CreatedJobs_72 + CreatedJobs_77 + CreatedJobs_82 + CreatedJobs_87 + CreatedJobs_92 + CreatedJobs_97 + CreatedJobs_102 + place_482_2 + TheSour_2 = 1
inv : FetchJobE_0 + QueueJobB_0 + f3_0 + f2_0 + f1_0 + NotifyEventJobQueuedB_0 + AvailableJobId_0 = 1
inv : FetchJobE_7 + QueueJobB_7 + f3_7 + f2_7 + f1_7 + NotifyEventJobQueuedB_7 + AvailableJobId_7 = 1
inv : CreatedJobs_10 + CreatedJobs_11 + CreatedJobs_12 + CreatedJobs_13 + CreatedJobs_14 + AvailableJobId_2 = 1
inv : CreatedJobs_50 + CreatedJobs_51 + CreatedJobs_52 + CreatedJobs_53 + CreatedJobs_54 + AvailableJobId_10 = 1
inv : QueueJobE_0 + QueueJobB_0 + QueueJobB_1 + QueueJobB_2 + QueueJobB_3 + QueueJobB_4 + QueueJobB_5 + QueueJobB_6 + QueueJobB_7 + QueueJobB_8 + QueueJobB_9 + QueueJobB_10 + QueueJobB_11 + QueueJobB_12 + QueueJobB_13 + QueueJobB_14 + QueueJobB_15 + QueueJobB_16 + QueueJobB_17 + QueueJobB_18 + QueueJobB_19 + QueueJobB_20 + NotifyEventJobQueuedB_0 + NotifyEventJobQueuedB_1 + NotifyEventJobQueuedB_2 + NotifyEventJobQueuedB_3 + NotifyEventJobQueuedB_4 + NotifyEventJobQueuedB_5 + NotifyEventJobQueuedB_6 + NotifyEventJobQueuedB_7 + NotifyEventJobQueuedB_8 + NotifyEventJobQueuedB_9 + NotifyEventJobQueuedB_10 + NotifyEventJobQueuedB_11 + NotifyEventJobQueuedB_12 + NotifyEventJobQueuedB_13 + NotifyEventJobQueuedB_14 + NotifyEventJobQueuedB_15 + NotifyEventJobQueuedB_16 + NotifyEventJobQueuedB_17 + NotifyEventJobQueuedB_18 + NotifyEventJobQueuedB_19 + NotifyEventJobQueuedB_20 + place_482_0 + place_482_1 + place_482_2 + place_482_3 + place_482_4 - place_462_0 - place_460_0 - place_458_0 - place_456_0 = 0
inv : CreatedJobs_80 + CreatedJobs_81 + CreatedJobs_82 + CreatedJobs_83 + CreatedJobs_84 + AvailableJobId_16 = 1
inv : CreatedJobs_90 + CreatedJobs_91 + CreatedJobs_92 + CreatedJobs_93 + CreatedJobs_94 + AvailableJobId_18 = 1
inv : JobCnt_0 + cJobCnt_0 = 10
inv : FetchJobB_0 - QueueJobB_0 - QueueJobB_1 - QueueJobB_2 - QueueJobB_3 - QueueJobB_4 - QueueJobB_5 - QueueJobB_6 - QueueJobB_7 - QueueJobB_8 - QueueJobB_9 - QueueJobB_10 - QueueJobB_11 - QueueJobB_12 - QueueJobB_13 - QueueJobB_14 - QueueJobB_15 - QueueJobB_16 - QueueJobB_17 - QueueJobB_18 - QueueJobB_19 - QueueJobB_20 - f3_0 - f3_1 - f3_2 - f3_3 - f3_4 - f3_5 - f3_6 - f3_7 - f3_8 - f3_9 - f3_10 - f3_11 - f3_12 - f3_13 - f3_14 - f3_15 - f3_16 - f3_17 - f3_18 - f3_19 - f3_20 - f2_0 - f2_1 - f2_2 - f2_3 - f2_4 - f2_5 - f2_6 - f2_7 - f2_8 - f2_9 - f2_10 - f2_11 - f2_12 - f2_13 - f2_14 - f2_15 - f2_16 - f2_17 - f2_18 - f2_19 - f2_20 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - cJobCnt_0 = -10
inv : CreatedJobs_40 + CreatedJobs_41 + CreatedJobs_42 + CreatedJobs_43 + CreatedJobs_44 + AvailableJobId_8 = 1
inv : CreatedJobs_0 + CreatedJobs_1 + CreatedJobs_2 + CreatedJobs_3 + CreatedJobs_4 + AvailableJobId_0 = 1
inv : FetchJobE_6 + QueueJobB_6 + f3_6 + f2_6 + f1_6 + NotifyEventJobQueuedB_6 + AvailableJobId_6 = 1
inv : FetchJobE_14 + QueueJobB_14 + f3_14 + f2_14 + f1_14 + NotifyEventJobQueuedB_14 + AvailableJobId_14 = 1
inv : CreatedJobs_20 + CreatedJobs_21 + CreatedJobs_22 + CreatedJobs_23 + CreatedJobs_24 + AvailableJobId_4 = 1
inv : FetchJobE_15 + QueueJobB_15 + f3_15 + f2_15 + f1_15 + NotifyEventJobQueuedB_15 + AvailableJobId_15 = 1
inv : f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + mo1_0 - f1_0 - f1_1 - f1_2 - f1_3 - f1_4 - f1_5 - f1_6 - f1_7 - f1_8 - f1_9 - f1_10 - f1_11 - f1_12 - f1_13 - f1_14 - f1_15 - f1_16 - f1_17 - f1_18 - f1_19 - f1_20 - mi1_0 = 0
inv : block_0 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 = 3
Total of 57 invariants.
[2021-05-17 00:32:32] [INFO ] Computed 57 place invariants in 9 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 1165
[2021-05-17 00:32:33] [INFO ] Proved 290 variables to be positive in 1059 ms
[2021-05-17 00:32:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:32:33] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=0 took 53 ms
[2021-05-17 00:32:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:32:33] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=1 took 99 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1165 after 36274
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36274 after 73530
Compilation finished in 2700 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10071170604951988490]
Link finished in 50 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, -i, PolyORBNTCOLS05J20ReachabilityFireability03==true], workingDir=/tmp/ltsmin10071170604951988490]
[2021-05-17 00:32:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:32:40] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=2 took 6660 ms
[2021-05-17 00:32:41] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=3 took 9590 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :73530 after 1.83522e+06
[2021-05-17 00:33:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:33:03] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=3 took 23817 ms
[2021-05-17 00:34:01] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=4 took 79361 ms
[2021-05-17 00:36:10] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=5 took 129507 ms
[2021-05-17 00:37:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:37:35] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=4 took 271426 ms
[2021-05-17 00:46:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:46:51] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=5 took 555555 ms
[2021-05-17 00:47:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPolyORBNT-COL-S05J20-ReachabilityFireability-03
[2021-05-17 00:47:43] [INFO ] KInduction solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(SAT) depth K=6 took 52206 ms
[2021-05-17 00:47:49] [INFO ] BMC solution for property PolyORBNT-COL-S05J20-ReachabilityFireability-03(UNSAT) depth K=6 took 698911 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: Initializing POR dependencies: labels 407, guards 406
pins2lts-mc-linux64( 0/ 8), 0.554: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 0.593: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.583: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.583: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.594: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.584: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.588: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.592: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.584: "PolyORBNTCOLS05J20ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.592: There are 407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.592: State length is 290, there are 406 groups
pins2lts-mc-linux64( 0/ 8), 0.592: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.592: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.592: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.592: Visible groups: 2 / 406, labels: 1 / 407
pins2lts-mc-linux64( 0/ 8), 0.592: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.592: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.948: ~6 levels ~960 states ~2304 transitions
pins2lts-mc-linux64( 3/ 8), 0.985: ~1 levels ~1920 states ~9920 transitions
pins2lts-mc-linux64( 3/ 8), 1.016: ~2 levels ~3840 states ~15128 transitions
pins2lts-mc-linux64( 3/ 8), 1.130: ~2 levels ~7680 states ~25088 transitions
pins2lts-mc-linux64( 3/ 8), 1.284: ~3 levels ~15360 states ~43344 transitions
pins2lts-mc-linux64( 3/ 8), 1.451: ~5 levels ~30720 states ~67768 transitions
pins2lts-mc-linux64( 3/ 8), 1.787: ~8 levels ~61440 states ~114208 transitions
pins2lts-mc-linux64( 1/ 8), 3.452: ~8 levels ~122880 states ~284232 transitions
pins2lts-mc-linux64( 1/ 8), 6.175: ~12 levels ~245760 states ~557720 transitions
pins2lts-mc-linux64( 1/ 8), 11.527: ~14 levels ~491520 states ~1219536 transitions
pins2lts-mc-linux64( 3/ 8), 17.478: ~32 levels ~983040 states ~2111464 transitions
pins2lts-mc-linux64( 3/ 8), 33.791: ~58 levels ~1966080 states ~4111808 transitions
pins2lts-mc-linux64( 0/ 8), 96.050: ~16 levels ~3932160 states ~12248656 transitions
pins2lts-mc-linux64( 0/ 8), 147.121: ~22 levels ~7864320 states ~19081432 transitions
pins2lts-mc-linux64( 6/ 8), 321.751: ~16 levels ~15728640 states ~39510608 transitions
pins2lts-mc-linux64( 6/ 8), 648.349: ~31 levels ~31457280 states ~73646344 transitions
pins2lts-mc-linux64( 6/ 8), 1036.992: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1037.184:
pins2lts-mc-linux64( 0/ 8), 1037.185: mean standard work distribution: 58.8% (states) 5.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1037.185:
pins2lts-mc-linux64( 0/ 8), 1037.185: Explored 24752885 states 110942707 transitions, fanout: 4.482
pins2lts-mc-linux64( 0/ 8), 1037.185: Total exploration time 1036.500 sec (1036.400 sec minimum, 1036.445 sec on average)
pins2lts-mc-linux64( 0/ 8), 1037.185: States per second: 23881, Transitions per second: 107036
pins2lts-mc-linux64( 0/ 8), 1037.185: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1037.185:
pins2lts-mc-linux64( 0/ 8), 1037.185: Queue width: 8B, total height: 14269396, memory: 108.87MB
pins2lts-mc-linux64( 0/ 8), 1037.185: Tree memory: 543.6MB, 15.1 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 1037.185: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1037.185: Stored 408 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1037.185: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1037.185: Est. total memory use: 652.5MB (~1132.9MB 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, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J20ReachabilityFireability03==true], workingDir=/tmp/ltsmin10071170604951988490]
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, -p, --pins-guards, --when, -i, PolyORBNTCOLS05J20ReachabilityFireability03==true], workingDir=/tmp/ltsmin10071170604951988490]
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-17 00:53:44] [INFO ] Applying decomposition
[2021-05-17 00:53:44] [INFO ] Flatten gal took : 20 ms
[2021-05-17 00:53:44] [INFO ] Decomposing Gal with order
[2021-05-17 00:53:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:53:44] [INFO ] Removed a total of 1504 redundant transitions.
[2021-05-17 00:53:44] [INFO ] Flatten gal took : 97 ms
[2021-05-17 00:53:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-17 00:53:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6269053171255384976.gal : 9 ms
[2021-05-17 00:53:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15783932559953302197.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability6269053171255384976.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15783932559953302197.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability6269053171255384976.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15783932559953302197.prop --nowitness
Loading property file /tmp/ReachabilityFireability15783932559953302197.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.27496e+08,70.2006,1231628,472793,24,2.12612e+06,1623,1007,1.0473e+06,48,1526,0
Total reachable state count : 327495725

Verifying 1 reachability properties.
Reachability property PolyORBNT-COL-S05J20-ReachabilityFireability-03 does not hold.
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : PolyORBNT-COL-S05J20-ReachabilityFireability-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J20-ReachabilityFireability-03,0,70.3852,1231628,1,0,2.12612e+06,1623,1007,1.0473e+06,49,1526,0
[2021-05-17 00:54:55] [WARNING] Interrupting SMT solver.
[2021-05-17 00:54:55] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-17 00:54:55] [WARNING] Unexpected error occurred while running SMT. Was verifying PolyORBNT-COL-S05J20-ReachabilityFireability-03 SMT depth 7
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2021-05-17 00:54:55] [INFO ] During BMC, SMT solver timed out at depth 7
[2021-05-17 00:54:55] [INFO ] BMC solving timed out (3600000 secs) at depth 7
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-17 00:54:55] [WARNING] Unexpected error occurred while running SMT. Was verifying PolyORBNT-COL-S05J20-ReachabilityFireability-03 K-induction depth 7
Exception in thread "Thread-17" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2021-05-17 00:54:55] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1621212896278

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="ReachabilityFireability"
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 PolyORBNT-COL-S05J20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089268300367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;