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.r216-tall-162098205800901.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 ShieldPPPt-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205800901
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 762K May 5 16:52 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 ShieldPPPt-PT-040B-00
FORMULA_NAME ShieldPPPt-PT-040B-01
FORMULA_NAME ShieldPPPt-PT-040B-02
FORMULA_NAME ShieldPPPt-PT-040B-03
FORMULA_NAME ShieldPPPt-PT-040B-04
FORMULA_NAME ShieldPPPt-PT-040B-05
FORMULA_NAME ShieldPPPt-PT-040B-06
FORMULA_NAME ShieldPPPt-PT-040B-07
FORMULA_NAME ShieldPPPt-PT-040B-08
FORMULA_NAME ShieldPPPt-PT-040B-09
FORMULA_NAME ShieldPPPt-PT-040B-10
FORMULA_NAME ShieldPPPt-PT-040B-11
FORMULA_NAME ShieldPPPt-PT-040B-12
FORMULA_NAME ShieldPPPt-PT-040B-13
FORMULA_NAME ShieldPPPt-PT-040B-14
FORMULA_NAME ShieldPPPt-PT-040B-15

=== Now, execution of the tool begins

BK_START 1622944688335

Running Version 0
[2021-06-06 01:58:10] [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-06-06 01:58:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 01:58:10] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2021-06-06 01:58:10] [INFO ] Transformed 3123 places.
[2021-06-06 01:58:10] [INFO ] Transformed 2843 transitions.
[2021-06-06 01:58:10] [INFO ] Found NUPN structural information;
[2021-06-06 01:58:10] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 01:58:10] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldPPPt-PT-040B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 428 places :
Symmetric choice reduction at 0 with 428 rule applications. Total rules 428 place count 2695 transition count 2415
Iterating global reduction 0 with 428 rules applied. Total rules applied 856 place count 2695 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 2694 transition count 2414
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 2694 transition count 2414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 2693 transition count 2413
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 2693 transition count 2413
Applied a total of 860 rules in 1530 ms. Remains 2693 /3123 variables (removed 430) and now considering 2413/2843 (removed 430) transitions.
// Phase 1: matrix 2413 rows 2693 cols
[2021-06-06 01:58:12] [INFO ] Computed 441 place invariants in 44 ms
[2021-06-06 01:58:13] [INFO ] Implicit Places using invariants in 1090 ms returned []
// Phase 1: matrix 2413 rows 2693 cols
[2021-06-06 01:58:13] [INFO ] Computed 441 place invariants in 12 ms
[2021-06-06 01:58:16] [INFO ] Implicit Places using invariants and state equation in 2656 ms returned []
Implicit Place search using SMT with State Equation took 3773 ms to find 0 implicit places.
// Phase 1: matrix 2413 rows 2693 cols
[2021-06-06 01:58:16] [INFO ] Computed 441 place invariants in 11 ms
[2021-06-06 01:58:17] [INFO ] Dead Transitions using invariants and state equation in 1637 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2693/3123 places, 2413/2843 transitions.
[2021-06-06 01:58:18] [INFO ] Flatten gal took : 177 ms
[2021-06-06 01:58:18] [INFO ] Flatten gal took : 109 ms
[2021-06-06 01:58:18] [INFO ] Input system was already deterministic with 2413 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=107 ) properties (out of 21) seen :16
Running SMT prover for 5 properties.
// Phase 1: matrix 2413 rows 2693 cols
[2021-06-06 01:58:19] [INFO ] Computed 441 place invariants in 15 ms
[2021-06-06 01:58:19] [INFO ] [Real]Absence check using 441 positive place invariants in 188 ms returned sat
[2021-06-06 01:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:20] [INFO ] [Real]Absence check using state equation in 1176 ms returned sat
[2021-06-06 01:58:21] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:21] [INFO ] [Nat]Absence check using 441 positive place invariants in 105 ms returned unsat
[2021-06-06 01:58:21] [INFO ] [Real]Absence check using 441 positive place invariants in 155 ms returned sat
[2021-06-06 01:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:23] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2021-06-06 01:58:23] [INFO ] Deduced a trap composed of 17 places in 647 ms of which 6 ms to minimize.
[2021-06-06 01:58:24] [INFO ] Deduced a trap composed of 39 places in 610 ms of which 3 ms to minimize.
[2021-06-06 01:58:25] [INFO ] Deduced a trap composed of 29 places in 565 ms of which 2 ms to minimize.
[2021-06-06 01:58:25] [INFO ] Deduced a trap composed of 19 places in 572 ms of which 3 ms to minimize.
[2021-06-06 01:58:26] [INFO ] Deduced a trap composed of 30 places in 514 ms of which 1 ms to minimize.
[2021-06-06 01:58:27] [INFO ] Deduced a trap composed of 18 places in 551 ms of which 1 ms to minimize.
[2021-06-06 01:58:27] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 3 ms to minimize.
[2021-06-06 01:58:28] [INFO ] Deduced a trap composed of 16 places in 555 ms of which 1 ms to minimize.
[2021-06-06 01:58:29] [INFO ] Deduced a trap composed of 28 places in 517 ms of which 2 ms to minimize.
[2021-06-06 01:58:29] [INFO ] Deduced a trap composed of 17 places in 562 ms of which 2 ms to minimize.
[2021-06-06 01:58:30] [INFO ] Deduced a trap composed of 21 places in 526 ms of which 1 ms to minimize.
[2021-06-06 01:58:31] [INFO ] Deduced a trap composed of 31 places in 505 ms of which 2 ms to minimize.
[2021-06-06 01:58:31] [INFO ] Deduced a trap composed of 28 places in 520 ms of which 1 ms to minimize.
[2021-06-06 01:58:32] [INFO ] Deduced a trap composed of 24 places in 514 ms of which 1 ms to minimize.
[2021-06-06 01:58:32] [INFO ] Deduced a trap composed of 42 places in 492 ms of which 1 ms to minimize.
[2021-06-06 01:58:33] [INFO ] Deduced a trap composed of 41 places in 492 ms of which 1 ms to minimize.
[2021-06-06 01:58:33] [INFO ] Deduced a trap composed of 32 places in 486 ms of which 2 ms to minimize.
[2021-06-06 01:58:34] [INFO ] Deduced a trap composed of 29 places in 480 ms of which 1 ms to minimize.
[2021-06-06 01:58:35] [INFO ] Deduced a trap composed of 25 places in 467 ms of which 1 ms to minimize.
[2021-06-06 01:58:35] [INFO ] Deduced a trap composed of 28 places in 454 ms of which 1 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 19 places in 444 ms of which 2 ms to minimize.
[2021-06-06 01:58:36] [INFO ] Deduced a trap composed of 27 places in 455 ms of which 2 ms to minimize.
[2021-06-06 01:58:37] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 1 ms to minimize.
[2021-06-06 01:58:37] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 1 ms to minimize.
[2021-06-06 01:58:38] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 1 ms to minimize.
[2021-06-06 01:58:38] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 1 ms to minimize.
[2021-06-06 01:58:39] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 1 ms to minimize.
[2021-06-06 01:58:39] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 1 ms to minimize.
[2021-06-06 01:58:40] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 2 ms to minimize.
[2021-06-06 01:58:40] [INFO ] Deduced a trap composed of 43 places in 347 ms of which 1 ms to minimize.
[2021-06-06 01:58:41] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 1 ms to minimize.
[2021-06-06 01:58:41] [INFO ] Deduced a trap composed of 37 places in 353 ms of which 1 ms to minimize.
[2021-06-06 01:58:41] [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 1
[2021-06-06 01:58:42] [INFO ] [Real]Absence check using 441 positive place invariants in 169 ms returned sat
[2021-06-06 01:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:43] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2021-06-06 01:58:43] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:58:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 161 ms returned sat
[2021-06-06 01:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:58:44] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2021-06-06 01:58:45] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 1 ms to minimize.
[2021-06-06 01:58:46] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 1 ms to minimize.
[2021-06-06 01:58:46] [INFO ] Deduced a trap composed of 30 places in 560 ms of which 1 ms to minimize.
[2021-06-06 01:58:47] [INFO ] Deduced a trap composed of 28 places in 558 ms of which 1 ms to minimize.
[2021-06-06 01:58:48] [INFO ] Deduced a trap composed of 23 places in 559 ms of which 1 ms to minimize.
[2021-06-06 01:58:48] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 1 ms to minimize.
[2021-06-06 01:58:49] [INFO ] Deduced a trap composed of 30 places in 503 ms of which 1 ms to minimize.
[2021-06-06 01:58:50] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 1 ms to minimize.
[2021-06-06 01:58:50] [INFO ] Deduced a trap composed of 16 places in 493 ms of which 1 ms to minimize.
[2021-06-06 01:58:51] [INFO ] Deduced a trap composed of 18 places in 483 ms of which 2 ms to minimize.
[2021-06-06 01:58:51] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 2 ms to minimize.
[2021-06-06 01:58:52] [INFO ] Deduced a trap composed of 23 places in 472 ms of which 2 ms to minimize.
[2021-06-06 01:58:52] [INFO ] Deduced a trap composed of 26 places in 498 ms of which 2 ms to minimize.
[2021-06-06 01:58:53] [INFO ] Deduced a trap composed of 23 places in 475 ms of which 1 ms to minimize.
[2021-06-06 01:58:54] [INFO ] Deduced a trap composed of 27 places in 464 ms of which 1 ms to minimize.
[2021-06-06 01:58:54] [INFO ] Deduced a trap composed of 20 places in 458 ms of which 1 ms to minimize.
[2021-06-06 01:58:55] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 1 ms to minimize.
[2021-06-06 01:58:55] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 1 ms to minimize.
[2021-06-06 01:58:56] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 1 ms to minimize.
[2021-06-06 01:58:56] [INFO ] Deduced a trap composed of 21 places in 432 ms of which 2 ms to minimize.
[2021-06-06 01:58:57] [INFO ] Deduced a trap composed of 27 places in 430 ms of which 1 ms to minimize.
[2021-06-06 01:58:57] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 1 ms to minimize.
[2021-06-06 01:58:58] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 2 ms to minimize.
[2021-06-06 01:58:58] [INFO ] Deduced a trap composed of 43 places in 379 ms of which 11 ms to minimize.
[2021-06-06 01:58:59] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 1 ms to minimize.
[2021-06-06 01:58:59] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 20 places in 375 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 1 ms to minimize.
[2021-06-06 01:59:00] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 1 ms to minimize.
[2021-06-06 01:59:01] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 1 ms to minimize.
[2021-06-06 01:59:01] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 1 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 1 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 1 ms to minimize.
[2021-06-06 01:59:02] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 2 ms to minimize.
[2021-06-06 01:59:03] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 1 ms to minimize.
[2021-06-06 01:59:04] [INFO ] Deduced a trap composed of 16 places in 1450 ms of which 3 ms to minimize.
[2021-06-06 01:59:04] [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 2
[2021-06-06 01:59:05] [INFO ] [Real]Absence check using 441 positive place invariants in 170 ms returned sat
[2021-06-06 01:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:06] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2021-06-06 01:59:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:06] [INFO ] [Nat]Absence check using 441 positive place invariants in 159 ms returned sat
[2021-06-06 01:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:08] [INFO ] [Nat]Absence check using state equation in 1155 ms returned sat
[2021-06-06 01:59:08] [INFO ] Deduced a trap composed of 23 places in 574 ms of which 1 ms to minimize.
[2021-06-06 01:59:09] [INFO ] Deduced a trap composed of 23 places in 569 ms of which 1 ms to minimize.
[2021-06-06 01:59:10] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 2 ms to minimize.
[2021-06-06 01:59:10] [INFO ] Deduced a trap composed of 20 places in 546 ms of which 1 ms to minimize.
[2021-06-06 01:59:11] [INFO ] Deduced a trap composed of 22 places in 551 ms of which 1 ms to minimize.
[2021-06-06 01:59:11] [INFO ] Deduced a trap composed of 30 places in 537 ms of which 2 ms to minimize.
[2021-06-06 01:59:12] [INFO ] Deduced a trap composed of 25 places in 531 ms of which 1 ms to minimize.
[2021-06-06 01:59:13] [INFO ] Deduced a trap composed of 17 places in 530 ms of which 2 ms to minimize.
[2021-06-06 01:59:13] [INFO ] Deduced a trap composed of 17 places in 532 ms of which 2 ms to minimize.
[2021-06-06 01:59:14] [INFO ] Deduced a trap composed of 19 places in 557 ms of which 3 ms to minimize.
[2021-06-06 01:59:15] [INFO ] Deduced a trap composed of 29 places in 544 ms of which 1 ms to minimize.
[2021-06-06 01:59:15] [INFO ] Deduced a trap composed of 29 places in 581 ms of which 2 ms to minimize.
[2021-06-06 01:59:16] [INFO ] Deduced a trap composed of 22 places in 563 ms of which 2 ms to minimize.
[2021-06-06 01:59:17] [INFO ] Deduced a trap composed of 20 places in 537 ms of which 1 ms to minimize.
[2021-06-06 01:59:17] [INFO ] Deduced a trap composed of 32 places in 520 ms of which 2 ms to minimize.
[2021-06-06 01:59:18] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 1 ms to minimize.
[2021-06-06 01:59:18] [INFO ] Deduced a trap composed of 19 places in 500 ms of which 2 ms to minimize.
[2021-06-06 01:59:19] [INFO ] Deduced a trap composed of 23 places in 534 ms of which 1 ms to minimize.
[2021-06-06 01:59:20] [INFO ] Deduced a trap composed of 26 places in 497 ms of which 2 ms to minimize.
[2021-06-06 01:59:20] [INFO ] Deduced a trap composed of 30 places in 460 ms of which 1 ms to minimize.
[2021-06-06 01:59:21] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 1 ms to minimize.
[2021-06-06 01:59:21] [INFO ] Deduced a trap composed of 32 places in 460 ms of which 1 ms to minimize.
[2021-06-06 01:59:22] [INFO ] Deduced a trap composed of 30 places in 449 ms of which 1 ms to minimize.
[2021-06-06 01:59:22] [INFO ] Deduced a trap composed of 26 places in 468 ms of which 1 ms to minimize.
[2021-06-06 01:59:23] [INFO ] Deduced a trap composed of 24 places in 460 ms of which 1 ms to minimize.
[2021-06-06 01:59:23] [INFO ] Deduced a trap composed of 23 places in 449 ms of which 1 ms to minimize.
[2021-06-06 01:59:24] [INFO ] Deduced a trap composed of 39 places in 417 ms of which 1 ms to minimize.
[2021-06-06 01:59:24] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 1 ms to minimize.
[2021-06-06 01:59:25] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 1 ms to minimize.
[2021-06-06 01:59:25] [INFO ] Deduced a trap composed of 27 places in 389 ms of which 1 ms to minimize.
[2021-06-06 01:59:26] [INFO ] Deduced a trap composed of 28 places in 379 ms of which 1 ms to minimize.
[2021-06-06 01:59:26] [INFO ] Deduced a trap composed of 28 places in 459 ms of which 1 ms to minimize.
[2021-06-06 01:59:26] [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 3
[2021-06-06 01:59:27] [INFO ] [Real]Absence check using 441 positive place invariants in 156 ms returned sat
[2021-06-06 01:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:28] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2021-06-06 01:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 01:59:28] [INFO ] [Nat]Absence check using 441 positive place invariants in 160 ms returned sat
[2021-06-06 01:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 01:59:29] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2021-06-06 01:59:30] [INFO ] Deduced a trap composed of 23 places in 570 ms of which 1 ms to minimize.
[2021-06-06 01:59:31] [INFO ] Deduced a trap composed of 19 places in 557 ms of which 1 ms to minimize.
[2021-06-06 01:59:31] [INFO ] Deduced a trap composed of 16 places in 561 ms of which 1 ms to minimize.
[2021-06-06 01:59:32] [INFO ] Deduced a trap composed of 17 places in 536 ms of which 2 ms to minimize.
[2021-06-06 01:59:33] [INFO ] Deduced a trap composed of 30 places in 541 ms of which 2 ms to minimize.
[2021-06-06 01:59:33] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 2 ms to minimize.
[2021-06-06 01:59:34] [INFO ] Deduced a trap composed of 26 places in 557 ms of which 1 ms to minimize.
[2021-06-06 01:59:34] [INFO ] Deduced a trap composed of 19 places in 514 ms of which 1 ms to minimize.
[2021-06-06 01:59:35] [INFO ] Deduced a trap composed of 29 places in 509 ms of which 1 ms to minimize.
[2021-06-06 01:59:36] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 2 ms to minimize.
[2021-06-06 01:59:36] [INFO ] Deduced a trap composed of 25 places in 492 ms of which 1 ms to minimize.
[2021-06-06 01:59:37] [INFO ] Deduced a trap composed of 27 places in 499 ms of which 1 ms to minimize.
[2021-06-06 01:59:37] [INFO ] Deduced a trap composed of 32 places in 484 ms of which 1 ms to minimize.
[2021-06-06 01:59:38] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 2 ms to minimize.
[2021-06-06 01:59:38] [INFO ] Deduced a trap composed of 27 places in 475 ms of which 1 ms to minimize.
[2021-06-06 01:59:39] [INFO ] Deduced a trap composed of 22 places in 466 ms of which 1 ms to minimize.
[2021-06-06 01:59:40] [INFO ] Deduced a trap composed of 31 places in 447 ms of which 2 ms to minimize.
[2021-06-06 01:59:40] [INFO ] Deduced a trap composed of 24 places in 455 ms of which 12 ms to minimize.
[2021-06-06 01:59:41] [INFO ] Deduced a trap composed of 19 places in 432 ms of which 1 ms to minimize.
[2021-06-06 01:59:41] [INFO ] Deduced a trap composed of 19 places in 417 ms of which 2 ms to minimize.
[2021-06-06 01:59:42] [INFO ] Deduced a trap composed of 17 places in 421 ms of which 1 ms to minimize.
[2021-06-06 01:59:42] [INFO ] Deduced a trap composed of 29 places in 408 ms of which 2 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 1 ms to minimize.
[2021-06-06 01:59:43] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2021-06-06 01:59:44] [INFO ] Deduced a trap composed of 34 places in 395 ms of which 1 ms to minimize.
[2021-06-06 01:59:44] [INFO ] Deduced a trap composed of 36 places in 381 ms of which 1 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 1 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 1 ms to minimize.
[2021-06-06 01:59:45] [INFO ] Deduced a trap composed of 31 places in 371 ms of which 1 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 1 ms to minimize.
[2021-06-06 01:59:46] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 1 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 1 ms to minimize.
[2021-06-06 01:59:47] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 1 ms to minimize.
[2021-06-06 01:59:48] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 1 ms to minimize.
[2021-06-06 01:59:48] [INFO ] Deduced a trap composed of 35 places in 319 ms of which 1 ms to minimize.
[2021-06-06 01:59: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 4
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2692 transition count 1856
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 2136 transition count 1856
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1112 place count 2136 transition count 1541
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1742 place count 1821 transition count 1541
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1750 place count 1813 transition count 1533
Iterating global reduction 2 with 8 rules applied. Total rules applied 1758 place count 1813 transition count 1533
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1758 place count 1813 transition count 1525
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1774 place count 1805 transition count 1525
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 3134 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3135 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3137 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3339 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3375 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3376 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3377 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3377 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3381 place count 1001 transition count 840
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3382 place count 1000 transition count 839
Applied a total of 3382 rules in 699 ms. Remains 1000 /2693 variables (removed 1693) and now considering 839/2413 (removed 1574) transitions.
// Phase 1: matrix 839 rows 1000 cols
[2021-06-06 01:59:49] [INFO ] Computed 440 place invariants in 2 ms
[2021-06-06 01:59:49] [INFO ] Implicit Places using invariants in 518 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 520 ms to find 2 implicit places.
[2021-06-06 01:59:49] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2021-06-06 01:59:49] [INFO ] Computed 438 place invariants in 4 ms
[2021-06-06 01:59:50] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned []
Starting structural reductions, iteration 1 : 998/2693 places, 839/2413 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 837
Applied a total of 4 rules in 43 ms. Remains 996 /998 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 01:59:50] [INFO ] Computed 438 place invariants in 6 ms
[2021-06-06 01:59:50] [INFO ] Implicit Places using invariants in 544 ms returned []
// Phase 1: matrix 837 rows 996 cols
[2021-06-06 01:59:50] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 01:59:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-06-06 01:59:51] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 996/2693 places, 837/2413 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-00 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:(OR (NEQ s427 0) (NEQ s800 1))], 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 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-00 finished in 3574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2682 transition count 2402
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2682 transition count 2402
Applied a total of 22 rules in 471 ms. Remains 2682 /2693 variables (removed 11) and now considering 2402/2413 (removed 11) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 01:59:52] [INFO ] Computed 441 place invariants in 15 ms
[2021-06-06 01:59:53] [INFO ] Implicit Places using invariants in 904 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 01:59:53] [INFO ] Computed 441 place invariants in 15 ms
[2021-06-06 01:59:55] [INFO ] Implicit Places using invariants and state equation in 2433 ms returned []
Implicit Place search using SMT with State Equation took 3338 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 01:59:55] [INFO ] Computed 441 place invariants in 12 ms
[2021-06-06 01:59:57] [INFO ] Dead Transitions using invariants and state equation in 1461 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2682/2693 places, 2402/2413 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2219 0) (NEQ s689 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32 reset in 833 ms.
Stack based approach found an accepted trace after 7579 steps with 1 reset with depth 5342 and stack size 3343 in 76 ms.
FORMULA ShieldPPPt-PT-040B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-01 finished in 6319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))||(X(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2682 transition count 2402
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2682 transition count 2402
Applied a total of 22 rules in 460 ms. Remains 2682 /2693 variables (removed 11) and now considering 2402/2413 (removed 11) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 01:59:58] [INFO ] Computed 441 place invariants in 24 ms
[2021-06-06 01:59:59] [INFO ] Implicit Places using invariants in 896 ms returned []
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 01:59:59] [INFO ] Computed 441 place invariants in 14 ms
[2021-06-06 02:00:02] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
// Phase 1: matrix 2402 rows 2682 cols
[2021-06-06 02:00:02] [INFO ] Computed 441 place invariants in 12 ms
[2021-06-06 02:00:03] [INFO ] Dead Transitions using invariants and state equation in 1492 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2682/2693 places, 2402/2413 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s1960 1), p0:(OR (EQ s2009 0) (EQ s1803 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1207 ms.
Product exploration explored 100000 steps with 33333 reset in 1172 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 1171 ms.
Product exploration explored 100000 steps with 33333 reset in 1181 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 2682 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Performed 559 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2682 transition count 2402
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 559 place count 2682 transition count 2561
Deduced a syphon composed of 758 places in 3 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 758 place count 2682 transition count 2561
Performed 759 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1517 places in 4 ms
Iterating global reduction 1 with 759 rules applied. Total rules applied 1517 place count 2682 transition count 2561
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1518 place count 2682 transition count 2560
Renaming transitions due to excessive name length > 1024 char.
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 1801 place count 2399 transition count 2277
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 2084 place count 2399 transition count 2277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2085 place count 2399 transition count 2277
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2087 place count 2397 transition count 2275
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2089 place count 2397 transition count 2275
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1334 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2190 place count 2397 transition count 2705
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2291 place count 2296 transition count 2503
Deduced a syphon composed of 1233 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2392 place count 2296 transition count 2503
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 1290 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2449 place count 2296 transition count 2744
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2506 place count 2239 transition count 2630
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2563 place count 2239 transition count 2630
Deduced a syphon composed of 1233 places in 2 ms
Applied a total of 2563 rules in 2231 ms. Remains 2239 /2682 variables (removed 443) and now considering 2630/2402 (removed -228) transitions.
[2021-06-06 02:00:11] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 2630 rows 2239 cols
[2021-06-06 02:00:11] [INFO ] Computed 441 place invariants in 22 ms
[2021-06-06 02:00:13] [INFO ] Dead Transitions using invariants and state equation in 1445 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2239/2682 places, 2630/2402 transitions.
Product exploration explored 100000 steps with 33333 reset in 5695 ms.
Product exploration explored 100000 steps with 33333 reset in 5558 ms.
[2021-06-06 02:00:24] [INFO ] Flatten gal took : 102 ms
[2021-06-06 02:00:24] [INFO ] Flatten gal took : 69 ms
[2021-06-06 02:00:24] [INFO ] Time to serialize gal into /tmp/LTL15333167033439679387.gal : 44 ms
[2021-06-06 02:00:24] [INFO ] Time to serialize properties into /tmp/LTL4171940207770504964.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/LTL15333167033439679387.gal, -t, CGAL, -LTL, /tmp/LTL4171940207770504964.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/LTL15333167033439679387.gal -t CGAL -LTL /tmp/LTL4171940207770504964.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((p2333==0)||(p2093==1))"))))||((X("((p2333==0)||(p2093==1))"))&&(G("(p2279==1)")))))
Formula 0 simplified : !(XXF"((p2333==0)||(p2093==1))" | (X"((p2333==0)||(p2093==1))" & G"(p2279==1)"))
Detected timeout of ITS tools.
[2021-06-06 02:00:40] [INFO ] Flatten gal took : 66 ms
[2021-06-06 02:00:40] [INFO ] Applying decomposition
[2021-06-06 02:00:40] [INFO ] Flatten gal took : 67 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/graph17329518150360512300.txt, -o, /tmp/graph17329518150360512300.bin, -w, /tmp/graph17329518150360512300.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/graph17329518150360512300.bin, -l, -1, -v, -w, /tmp/graph17329518150360512300.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:00:40] [INFO ] Decomposing Gal with order
[2021-06-06 02:00:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:00:40] [INFO ] Removed a total of 399 redundant transitions.
[2021-06-06 02:00:40] [INFO ] Flatten gal took : 175 ms
[2021-06-06 02:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2021-06-06 02:00:41] [INFO ] Time to serialize gal into /tmp/LTL3381632180850546753.gal : 23 ms
[2021-06-06 02:00:41] [INFO ] Time to serialize properties into /tmp/LTL2236829363762142603.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/LTL3381632180850546753.gal, -t, CGAL, -LTL, /tmp/LTL2236829363762142603.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3381632180850546753.gal -t CGAL -LTL /tmp/LTL2236829363762142603.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i29.u716.p2333==0)||(i26.u639.p2093==1))"))))||((X("((i29.u716.p2333==0)||(i26.u639.p2093==1))"))&&(G("(i29.u698.p2279==1)")))))
Formula 0 simplified : !(XXF"((i29.u716.p2333==0)||(i26.u639.p2093==1))" | (X"((i29.u716.p2333==0)||(i26.u639.p2093==1))" & G"(i29.u698.p2279==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1571338691721397580
[2021-06-06 02:00:56] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1571338691721397580
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/ltsmin1571338691721397580]
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/ltsmin1571338691721397580] 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/ltsmin1571338691721397580] 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 ShieldPPPt-PT-040B-04 finished in 58688 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2692 transition count 1856
Reduce places removed 556 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 557 rules applied. Total rules applied 1113 place count 2136 transition count 1855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1114 place count 2135 transition count 1855
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 1114 place count 2135 transition count 1540
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1744 place count 1820 transition count 1540
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1754 place count 1810 transition count 1530
Iterating global reduction 3 with 10 rules applied. Total rules applied 1764 place count 1810 transition count 1530
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1764 place count 1810 transition count 1521
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1782 place count 1801 transition count 1521
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 3130 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3131 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3133 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3335 place count 1025 transition count 845
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3371 place count 1007 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3372 place count 1006 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3373 place count 1005 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3373 place count 1005 transition count 842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3377 place count 1003 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3378 place count 1002 transition count 841
Applied a total of 3378 rules in 544 ms. Remains 1002 /2693 variables (removed 1691) and now considering 841/2413 (removed 1572) transitions.
// Phase 1: matrix 841 rows 1002 cols
[2021-06-06 02:00:57] [INFO ] Computed 440 place invariants in 2 ms
[2021-06-06 02:00:58] [INFO ] Implicit Places using invariants in 520 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 521 ms to find 2 implicit places.
[2021-06-06 02:00:58] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 841 rows 1000 cols
[2021-06-06 02:00:58] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:00:58] [INFO ] Dead Transitions using invariants and state equation in 463 ms returned []
Starting structural reductions, iteration 1 : 1000/2693 places, 841/2413 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 839
Applied a total of 4 rules in 33 ms. Remains 998 /1000 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 998 cols
[2021-06-06 02:00:58] [INFO ] Computed 438 place invariants in 26 ms
[2021-06-06 02:00:59] [INFO ] Implicit Places using invariants in 560 ms returned []
// Phase 1: matrix 839 rows 998 cols
[2021-06-06 02:00:59] [INFO ] Computed 438 place invariants in 5 ms
[2021-06-06 02:00:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-06-06 02:01:00] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 998/2693 places, 839/2413 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s707 0) (EQ s544 1)) (OR (EQ s320 0) (EQ s977 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 716 ms.
Stack based approach found an accepted trace after 17062 steps with 0 reset with depth 17063 and stack size 15582 in 150 ms.
FORMULA ShieldPPPt-PT-040B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-05 finished in 4190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(X(G(p1)))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2681 transition count 2401
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2681 transition count 2401
Applied a total of 24 rules in 296 ms. Remains 2681 /2693 variables (removed 12) and now considering 2401/2413 (removed 12) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:01] [INFO ] Computed 441 place invariants in 7 ms
[2021-06-06 02:01:02] [INFO ] Implicit Places using invariants in 886 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:02] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:04] [INFO ] Implicit Places using invariants and state equation in 2491 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:05] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:06] [INFO ] Dead Transitions using invariants and state equation in 1504 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2693 places, 2401/2413 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s932 0) (EQ s30 1)), p1:(OR (EQ s1640 0) (EQ s2085 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 789 ms.
Product exploration explored 100000 steps with 0 reset in 1033 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 748 ms.
Product exploration explored 100000 steps with 0 reset in 974 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 4 out of 2681 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Performed 559 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2681 transition count 2401
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 559 place count 2681 transition count 2561
Deduced a syphon composed of 759 places in 4 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 759 place count 2681 transition count 2561
Performed 757 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1516 places in 3 ms
Iterating global reduction 1 with 757 rules applied. Total rules applied 1516 place count 2681 transition count 2561
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1517 place count 2681 transition count 2560
Renaming transitions due to excessive name length > 1024 char.
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 1799 place count 2399 transition count 2278
Deduced a syphon composed of 1234 places in 3 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 2081 place count 2399 transition count 2278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2082 place count 2399 transition count 2278
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2084 place count 2397 transition count 2276
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2086 place count 2397 transition count 2276
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1334 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2187 place count 2397 transition count 2706
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2288 place count 2296 transition count 2504
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2389 place count 2296 transition count 2504
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -240
Deduced a syphon composed of 1290 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2446 place count 2296 transition count 2744
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2503 place count 2239 transition count 2630
Deduced a syphon composed of 1233 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2560 place count 2239 transition count 2630
Deduced a syphon composed of 1233 places in 3 ms
Applied a total of 2560 rules in 935 ms. Remains 2239 /2681 variables (removed 442) and now considering 2630/2401 (removed -229) transitions.
[2021-06-06 02:01:11] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 2630 rows 2239 cols
[2021-06-06 02:01:11] [INFO ] Computed 441 place invariants in 13 ms
[2021-06-06 02:01:13] [INFO ] Dead Transitions using invariants and state equation in 1370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2239/2681 places, 2630/2401 transitions.
Product exploration explored 100000 steps with 0 reset in 755 ms.
Product exploration explored 100000 steps with 0 reset in 930 ms.
[2021-06-06 02:01:14] [INFO ] Flatten gal took : 70 ms
[2021-06-06 02:01:14] [INFO ] Flatten gal took : 71 ms
[2021-06-06 02:01:14] [INFO ] Time to serialize gal into /tmp/LTL5960909850136718612.gal : 10 ms
[2021-06-06 02:01:14] [INFO ] Time to serialize properties into /tmp/LTL4682786783544639344.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/LTL5960909850136718612.gal, -t, CGAL, -LTL, /tmp/LTL4682786783544639344.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/LTL5960909850136718612.gal -t CGAL -LTL /tmp/LTL4682786783544639344.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p1075==0)||(p30==1))")||(X(X(G("((p1904==0)||(p2424==1))"))))))))
Formula 0 simplified : !XG("((p1075==0)||(p30==1))" | XXG"((p1904==0)||(p2424==1))")
Detected timeout of ITS tools.
[2021-06-06 02:01:30] [INFO ] Flatten gal took : 62 ms
[2021-06-06 02:01:30] [INFO ] Applying decomposition
[2021-06-06 02:01:30] [INFO ] Flatten gal took : 58 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/graph14073058989996380496.txt, -o, /tmp/graph14073058989996380496.bin, -w, /tmp/graph14073058989996380496.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/graph14073058989996380496.bin, -l, -1, -v, -w, /tmp/graph14073058989996380496.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:01:30] [INFO ] Decomposing Gal with order
[2021-06-06 02:01:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:01:30] [INFO ] Removed a total of 402 redundant transitions.
[2021-06-06 02:01:30] [INFO ] Flatten gal took : 127 ms
[2021-06-06 02:01:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-06-06 02:01:30] [INFO ] Time to serialize gal into /tmp/LTL13291888299923009999.gal : 19 ms
[2021-06-06 02:01:30] [INFO ] Time to serialize properties into /tmp/LTL11076464839359150635.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/LTL13291888299923009999.gal, -t, CGAL, -LTL, /tmp/LTL11076464839359150635.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13291888299923009999.gal -t CGAL -LTL /tmp/LTL11076464839359150635.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i14.u335.p1075==0)||(i10.u13.p30==1))")||(X(X(G("((i24.u591.p1904==0)||(i30.u748.p2424==1))"))))))))
Formula 0 simplified : !XG("((i14.u335.p1075==0)||(i10.u13.p30==1))" | XXG"((i24.u591.p1904==0)||(i30.u748.p2424==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13283209033861466971
[2021-06-06 02:01:45] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13283209033861466971
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/ltsmin13283209033861466971]
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/ltsmin13283209033861466971] 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/ltsmin13283209033861466971] 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 ShieldPPPt-PT-040B-06 finished in 45489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((G(p1)||p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2681 transition count 2401
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2681 transition count 2401
Applied a total of 24 rules in 310 ms. Remains 2681 /2693 variables (removed 12) and now considering 2401/2413 (removed 12) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:47] [INFO ] Computed 441 place invariants in 14 ms
[2021-06-06 02:01:48] [INFO ] Implicit Places using invariants in 906 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:48] [INFO ] Computed 441 place invariants in 5 ms
[2021-06-06 02:01:50] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 3537 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:01:50] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:01:52] [INFO ] Dead Transitions using invariants and state equation in 1600 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2693 places, 2401/2413 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s2150 0) (EQ s1019 1)), p0:(OR (NEQ s1467 0) (NEQ s2507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 974 ms.
Product exploration explored 100000 steps with 25000 reset in 977 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 946 ms.
Product exploration explored 100000 steps with 25000 reset in 938 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2681 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Performed 557 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2681 transition count 2401
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 557 place count 2681 transition count 2561
Deduced a syphon composed of 757 places in 4 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 757 place count 2681 transition count 2561
Performed 760 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1517 places in 3 ms
Iterating global reduction 1 with 760 rules applied. Total rules applied 1517 place count 2681 transition count 2562
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1518 place count 2681 transition count 2561
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 1799 place count 2400 transition count 2280
Deduced a syphon composed of 1236 places in 3 ms
Iterating global reduction 2 with 281 rules applied. Total rules applied 2080 place count 2400 transition count 2280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1237 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2081 place count 2400 transition count 2280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2083 place count 2398 transition count 2278
Deduced a syphon composed of 1235 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2085 place count 2398 transition count 2278
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 1336 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2186 place count 2398 transition count 2705
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2287 place count 2297 transition count 2503
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2388 place count 2297 transition count 2503
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -243
Deduced a syphon composed of 1292 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2445 place count 2297 transition count 2746
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2502 place count 2240 transition count 2632
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2559 place count 2240 transition count 2632
Deduced a syphon composed of 1235 places in 3 ms
Applied a total of 2559 rules in 1105 ms. Remains 2240 /2681 variables (removed 441) and now considering 2632/2401 (removed -231) transitions.
[2021-06-06 02:01:57] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 2632 rows 2240 cols
[2021-06-06 02:01:57] [INFO ] Computed 441 place invariants in 22 ms
[2021-06-06 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 1515 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2240/2681 places, 2632/2401 transitions.
Product exploration explored 100000 steps with 25000 reset in 4453 ms.
Product exploration explored 100000 steps with 25000 reset in 4385 ms.
[2021-06-06 02:02:08] [INFO ] Flatten gal took : 62 ms
[2021-06-06 02:02:08] [INFO ] Flatten gal took : 62 ms
[2021-06-06 02:02:08] [INFO ] Time to serialize gal into /tmp/LTL13436633091746023285.gal : 8 ms
[2021-06-06 02:02:08] [INFO ] Time to serialize properties into /tmp/LTL8378047636704682361.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/LTL13436633091746023285.gal, -t, CGAL, -LTL, /tmp/LTL8378047636704682361.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/LTL13436633091746023285.gal -t CGAL -LTL /tmp/LTL8378047636704682361.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("((p1699!=0)||(p2914!=1))")||(G("((p2500==0)||(p1179==1))"))))))))
Formula 0 simplified : !XXXF("((p1699!=0)||(p2914!=1))" | G"((p2500==0)||(p1179==1))")
Detected timeout of ITS tools.
[2021-06-06 02:02:23] [INFO ] Flatten gal took : 57 ms
[2021-06-06 02:02:23] [INFO ] Applying decomposition
[2021-06-06 02:02:23] [INFO ] Flatten gal took : 57 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/graph6452564091059257323.txt, -o, /tmp/graph6452564091059257323.bin, -w, /tmp/graph6452564091059257323.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/graph6452564091059257323.bin, -l, -1, -v, -w, /tmp/graph6452564091059257323.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:02:23] [INFO ] Decomposing Gal with order
[2021-06-06 02:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:02:24] [INFO ] Removed a total of 402 redundant transitions.
[2021-06-06 02:02:24] [INFO ] Flatten gal took : 104 ms
[2021-06-06 02:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-06-06 02:02:24] [INFO ] Time to serialize gal into /tmp/LTL4266168086436513423.gal : 32 ms
[2021-06-06 02:02:24] [INFO ] Time to serialize properties into /tmp/LTL715442130400869193.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/LTL4266168086436513423.gal, -t, CGAL, -LTL, /tmp/LTL715442130400869193.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4266168086436513423.gal -t CGAL -LTL /tmp/LTL715442130400869193.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("((i22.i2.i1.u523.p1699!=0)||(i37.u894.p2914!=1))")||(G("((i32.i0.i1.u769.p2500==0)||(i16.u365.p1179==1))"))))))))
Formula 0 simplified : !XXXF("((i22.i2.i1.u523.p1699!=0)||(i37.u894.p2914!=1))" | G"((i32.i0.i1.u769.p2500==0)||(i16.u365.p1179==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5335921209815250134
[2021-06-06 02:02:39] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5335921209815250134
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/ltsmin5335921209815250134]
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/ltsmin5335921209815250134] 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/ltsmin5335921209815250134] 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 ShieldPPPt-PT-040B-07 finished in 53502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2683 transition count 2403
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2683 transition count 2403
Applied a total of 20 rules in 306 ms. Remains 2683 /2693 variables (removed 10) and now considering 2403/2413 (removed 10) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:02:40] [INFO ] Computed 441 place invariants in 11 ms
[2021-06-06 02:02:41] [INFO ] Implicit Places using invariants in 993 ms returned []
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:02:41] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:02:44] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 3526 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:02:44] [INFO ] Computed 441 place invariants in 7 ms
[2021-06-06 02:02:45] [INFO ] Dead Transitions using invariants and state equation in 1512 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2683/2693 places, 2403/2413 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s1072 0) (NEQ s2611 1) (OR (NEQ s2507 0) (NEQ s2681 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-08 finished in 5502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2681 transition count 2401
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2681 transition count 2401
Applied a total of 24 rules in 295 ms. Remains 2681 /2693 variables (removed 12) and now considering 2401/2413 (removed 12) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:46] [INFO ] Computed 441 place invariants in 5 ms
[2021-06-06 02:02:46] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:46] [INFO ] Computed 441 place invariants in 5 ms
[2021-06-06 02:02:49] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3392 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2681 cols
[2021-06-06 02:02:49] [INFO ] Computed 441 place invariants in 8 ms
[2021-06-06 02:02:50] [INFO ] Dead Transitions using invariants and state equation in 1464 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2681/2693 places, 2401/2413 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2200 0) (NEQ s1099 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23 reset in 752 ms.
Stack based approach found an accepted trace after 17260 steps with 3 reset with depth 3710 and stack size 3710 in 169 ms.
FORMULA ShieldPPPt-PT-040B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-09 finished in 6237 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 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2692 transition count 1856
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 2136 transition count 1856
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1112 place count 2136 transition count 1540
Deduced a syphon composed of 316 places in 3 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1744 place count 1820 transition count 1540
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1754 place count 1810 transition count 1530
Iterating global reduction 2 with 10 rules applied. Total rules applied 1764 place count 1810 transition count 1530
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1764 place count 1810 transition count 1521
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1782 place count 1801 transition count 1521
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 1 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 2 with 1354 rules applied. Total rules applied 3136 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3137 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3139 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3341 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3377 place count 1004 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3378 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3379 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3379 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3383 place count 1000 transition count 839
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3384 place count 999 transition count 838
Applied a total of 3384 rules in 452 ms. Remains 999 /2693 variables (removed 1694) and now considering 838/2413 (removed 1575) transitions.
// Phase 1: matrix 838 rows 999 cols
[2021-06-06 02:02:52] [INFO ] Computed 440 place invariants in 4 ms
[2021-06-06 02:02:53] [INFO ] Implicit Places using invariants in 511 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 515 ms to find 2 implicit places.
[2021-06-06 02:02:53] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 838 rows 997 cols
[2021-06-06 02:02:53] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:02:53] [INFO ] Dead Transitions using invariants and state equation in 439 ms returned []
Starting structural reductions, iteration 1 : 997/2693 places, 838/2413 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 40 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2021-06-06 02:02:53] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:02:54] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 836 rows 995 cols
[2021-06-06 02:02:54] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:02:55] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/2693 places, 836/2413 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s285 0) (EQ s541 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 780 ms.
Product exploration explored 100000 steps with 1 reset in 955 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 719 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-040B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-10 finished in 5693 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||X(F(p1))))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2683 transition count 2403
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2683 transition count 2403
Applied a total of 20 rules in 319 ms. Remains 2683 /2693 variables (removed 10) and now considering 2403/2413 (removed 10) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:02:58] [INFO ] Computed 441 place invariants in 14 ms
[2021-06-06 02:02:59] [INFO ] Implicit Places using invariants in 956 ms returned []
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:02:59] [INFO ] Computed 441 place invariants in 14 ms
[2021-06-06 02:03:01] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:03:01] [INFO ] Computed 441 place invariants in 7 ms
[2021-06-06 02:03:03] [INFO ] Dead Transitions using invariants and state equation in 1648 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2683/2693 places, 2403/2413 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s1007 0) (EQ s1942 1)), p0:(EQ s2048 1), p1:(OR (EQ s1007 0) (EQ s1942 1) (EQ s588 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1680 ms.
Product exploration explored 100000 steps with 50000 reset in 1703 ms.
Knowledge obtained : [p2, (NOT p0), p1]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1731 ms.
Product exploration explored 100000 steps with 50000 reset in 1722 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Performed 558 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2683 transition count 2403
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 558 place count 2683 transition count 2563
Deduced a syphon composed of 759 places in 3 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 759 place count 2683 transition count 2563
Performed 759 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1518 places in 4 ms
Iterating global reduction 1 with 759 rules applied. Total rules applied 1518 place count 2683 transition count 2563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1519 place count 2683 transition count 2562
Renaming transitions due to excessive name length > 1024 char.
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 1799 place count 2403 transition count 2282
Deduced a syphon composed of 1238 places in 3 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 2079 place count 2403 transition count 2282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1239 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2080 place count 2403 transition count 2282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2082 place count 2401 transition count 2280
Deduced a syphon composed of 1237 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2084 place count 2401 transition count 2280
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1338 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2185 place count 2401 transition count 2708
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2286 place count 2300 transition count 2506
Deduced a syphon composed of 1237 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2387 place count 2300 transition count 2506
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -244
Deduced a syphon composed of 1295 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2445 place count 2300 transition count 2750
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 2504 place count 2241 transition count 2632
Deduced a syphon composed of 1236 places in 3 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 2563 place count 2241 transition count 2632
Deduced a syphon composed of 1236 places in 3 ms
Applied a total of 2563 rules in 1040 ms. Remains 2241 /2683 variables (removed 442) and now considering 2632/2403 (removed -229) transitions.
[2021-06-06 02:03:11] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 2632 rows 2241 cols
[2021-06-06 02:03:11] [INFO ] Computed 441 place invariants in 24 ms
[2021-06-06 02:03:13] [INFO ] Dead Transitions using invariants and state equation in 1527 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2241/2683 places, 2632/2403 transitions.
Product exploration explored 100000 steps with 50000 reset in 8629 ms.
Product exploration explored 100000 steps with 50000 reset in 8634 ms.
[2021-06-06 02:03:30] [INFO ] Flatten gal took : 52 ms
[2021-06-06 02:03:30] [INFO ] Flatten gal took : 51 ms
[2021-06-06 02:03:30] [INFO ] Time to serialize gal into /tmp/LTL4657529757208578562.gal : 6 ms
[2021-06-06 02:03:30] [INFO ] Time to serialize properties into /tmp/LTL9499781337874496436.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/LTL4657529757208578562.gal, -t, CGAL, -LTL, /tmp/LTL9499781337874496436.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/LTL4657529757208578562.gal -t CGAL -LTL /tmp/LTL9499781337874496436.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(("(p2376==1)")||(X(F("(((p1163==0)||(p2254==1))||(p676==1))")))))&&(F("((p1163==0)||(p2254==1))"))))
Formula 0 simplified : !(F("(p2376==1)" | XF"(((p1163==0)||(p2254==1))||(p676==1))") & F"((p1163==0)||(p2254==1))")
Detected timeout of ITS tools.
[2021-06-06 02:03:46] [INFO ] Flatten gal took : 59 ms
[2021-06-06 02:03:46] [INFO ] Applying decomposition
[2021-06-06 02:03:46] [INFO ] Flatten gal took : 61 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/graph12721830751775830661.txt, -o, /tmp/graph12721830751775830661.bin, -w, /tmp/graph12721830751775830661.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/graph12721830751775830661.bin, -l, -1, -v, -w, /tmp/graph12721830751775830661.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:03:46] [INFO ] Decomposing Gal with order
[2021-06-06 02:03:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:03:46] [INFO ] Removed a total of 400 redundant transitions.
[2021-06-06 02:03:46] [INFO ] Flatten gal took : 109 ms
[2021-06-06 02:03:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-06-06 02:03:46] [INFO ] Time to serialize gal into /tmp/LTL6450840466168885626.gal : 17 ms
[2021-06-06 02:03:46] [INFO ] Time to serialize properties into /tmp/LTL9054751446165269861.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/LTL6450840466168885626.gal, -t, CGAL, -LTL, /tmp/LTL9054751446165269861.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6450840466168885626.gal -t CGAL -LTL /tmp/LTL9054751446165269861.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F(("(i30.i1.i0.u731.p2376==1)")||(X(F("(((i0.u359.p1163==0)||(i28.u695.p2254==1))||(i7.i1.i1.u209.p676==1))")))))&&(F("((i0.u359.p1163==0)||(i28.u695.p2254==1))"))))
Formula 0 simplified : !(F("(i30.i1.i0.u731.p2376==1)" | XF"(((i0.u359.p1163==0)||(i28.u695.p2254==1))||(i7.i1.i1.u209.p676==1))") & F"((i0.u359.p1163==0)||(i28.u695.p2254==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2023746261320126461
[2021-06-06 02:04:01] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2023746261320126461
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/ltsmin2023746261320126461]
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/ltsmin2023746261320126461] 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/ltsmin2023746261320126461] 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 ShieldPPPt-PT-040B-12 finished in 64937 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2683 transition count 2403
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2683 transition count 2403
Applied a total of 20 rules in 341 ms. Remains 2683 /2693 variables (removed 10) and now considering 2403/2413 (removed 10) transitions.
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:04:03] [INFO ] Computed 441 place invariants in 10 ms
[2021-06-06 02:04:03] [INFO ] Implicit Places using invariants in 928 ms returned []
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:04:03] [INFO ] Computed 441 place invariants in 6 ms
[2021-06-06 02:04:06] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 3621 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2683 cols
[2021-06-06 02:04:06] [INFO ] Computed 441 place invariants in 8 ms
[2021-06-06 02:04:08] [INFO ] Dead Transitions using invariants and state equation in 1575 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2683/2693 places, 2403/2413 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s2454 1), p0:(AND (OR (EQ s2384 0) (EQ s2286 1)) (OR (EQ s2136 0) (EQ s1212 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1713 ms.
Product exploration explored 100000 steps with 50000 reset in 1684 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 1757 ms.
Product exploration explored 100000 steps with 50000 reset in 1748 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 2683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2683/2683 places, 2403/2403 transitions.
Performed 559 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2683 transition count 2403
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 198 Pre rules applied. Total rules applied 559 place count 2683 transition count 2563
Deduced a syphon composed of 757 places in 4 ms
Iterating global reduction 1 with 198 rules applied. Total rules applied 757 place count 2683 transition count 2563
Performed 762 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1519 places in 4 ms
Iterating global reduction 1 with 762 rules applied. Total rules applied 1519 place count 2683 transition count 2565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1520 place count 2683 transition count 2564
Renaming transitions due to excessive name length > 1024 char.
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 1804 place count 2399 transition count 2278
Deduced a syphon composed of 1235 places in 3 ms
Iterating global reduction 2 with 284 rules applied. Total rules applied 2088 place count 2399 transition count 2278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1236 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2089 place count 2399 transition count 2278
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2091 place count 2397 transition count 2276
Deduced a syphon composed of 1234 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2093 place count 2397 transition count 2276
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1335 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2194 place count 2397 transition count 2706
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2295 place count 2296 transition count 2504
Deduced a syphon composed of 1234 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2396 place count 2296 transition count 2504
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -235
Deduced a syphon composed of 1289 places in 3 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 2451 place count 2296 transition count 2739
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2507 place count 2240 transition count 2627
Deduced a syphon composed of 1233 places in 5 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2563 place count 2240 transition count 2627
Deduced a syphon composed of 1233 places in 2 ms
Applied a total of 2563 rules in 1141 ms. Remains 2240 /2683 variables (removed 443) and now considering 2627/2403 (removed -224) transitions.
[2021-06-06 02:04:16] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 2627 rows 2240 cols
[2021-06-06 02:04:17] [INFO ] Computed 441 place invariants in 23 ms
[2021-06-06 02:04:18] [INFO ] Dead Transitions using invariants and state equation in 1446 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2240/2683 places, 2627/2403 transitions.
Product exploration explored 100000 steps with 50000 reset in 8621 ms.
Product exploration explored 100000 steps with 50000 reset in 8585 ms.
[2021-06-06 02:04:35] [INFO ] Flatten gal took : 52 ms
[2021-06-06 02:04:35] [INFO ] Flatten gal took : 57 ms
[2021-06-06 02:04:35] [INFO ] Time to serialize gal into /tmp/LTL11263893637396501788.gal : 6 ms
[2021-06-06 02:04:35] [INFO ] Time to serialize properties into /tmp/LTL6206585991731620263.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/LTL11263893637396501788.gal, -t, CGAL, -LTL, /tmp/LTL6206585991731620263.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/LTL11263893637396501788.gal -t CGAL -LTL /tmp/LTL6206585991731620263.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p2849==1)"))||("(((p2768==0)||(p2658==1))&&((p2481==0)||(p1403==1)))"))))
Formula 0 simplified : !X("(((p2768==0)||(p2658==1))&&((p2481==0)||(p1403==1)))" | G"(p2849==1)")
Detected timeout of ITS tools.
[2021-06-06 02:04:50] [INFO ] Flatten gal took : 54 ms
[2021-06-06 02:04:50] [INFO ] Applying decomposition
[2021-06-06 02:04:50] [INFO ] Flatten gal took : 54 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/graph13522469841152125847.txt, -o, /tmp/graph13522469841152125847.bin, -w, /tmp/graph13522469841152125847.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/graph13522469841152125847.bin, -l, -1, -v, -w, /tmp/graph13522469841152125847.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:04:51] [INFO ] Decomposing Gal with order
[2021-06-06 02:04:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:04:51] [INFO ] Removed a total of 400 redundant transitions.
[2021-06-06 02:04:51] [INFO ] Flatten gal took : 104 ms
[2021-06-06 02:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-06-06 02:04:51] [INFO ] Time to serialize gal into /tmp/LTL9757848640909773383.gal : 17 ms
[2021-06-06 02:04:51] [INFO ] Time to serialize properties into /tmp/LTL8358918177857739350.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/LTL9757848640909773383.gal, -t, CGAL, -LTL, /tmp/LTL8358918177857739350.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9757848640909773383.gal -t CGAL -LTL /tmp/LTL8358918177857739350.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("(i37.u879.p2849==1)"))||("(((i36.u853.p2768==0)||(i34.u818.p2658==1))&&((i32.u761.p2481==0)||(i18.i2.i2.u433.p1403==1)))"))))
Formula 0 simplified : !X("(((i36.u853.p2768==0)||(i34.u818.p2658==1))&&((i32.u761.p2481==0)||(i18.i2.i2.u433.p1403==1)))" | G"(i37.u879.p2849==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6872951243144681687
[2021-06-06 02:05:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6872951243144681687
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/ltsmin6872951243144681687]
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/ltsmin6872951243144681687] 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/ltsmin6872951243144681687] 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 ShieldPPPt-PT-040B-13 finished in 64916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2692 transition count 1855
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 2135 transition count 1855
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 1114 place count 2135 transition count 1542
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1740 place count 1822 transition count 1542
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1749 place count 1813 transition count 1533
Iterating global reduction 2 with 9 rules applied. Total rules applied 1758 place count 1813 transition count 1533
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1758 place count 1813 transition count 1525
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1774 place count 1805 transition count 1525
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 2 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3132 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3133 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3135 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3337 place count 1024 transition count 844
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3371 place count 1007 transition count 844
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3372 place count 1006 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3373 place count 1005 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3373 place count 1005 transition count 841
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3377 place count 1003 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3378 place count 1002 transition count 840
Applied a total of 3378 rules in 587 ms. Remains 1002 /2693 variables (removed 1691) and now considering 840/2413 (removed 1573) transitions.
// Phase 1: matrix 840 rows 1002 cols
[2021-06-06 02:05:08] [INFO ] Computed 440 place invariants in 2 ms
[2021-06-06 02:05:08] [INFO ] Implicit Places using invariants in 669 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 671 ms to find 2 implicit places.
[2021-06-06 02:05:08] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 840 rows 1000 cols
[2021-06-06 02:05:08] [INFO ] Computed 438 place invariants in 3 ms
[2021-06-06 02:05:09] [INFO ] Dead Transitions using invariants and state equation in 470 ms returned []
Starting structural reductions, iteration 1 : 1000/2693 places, 840/2413 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 838
Applied a total of 4 rules in 56 ms. Remains 998 /1000 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 998 cols
[2021-06-06 02:05:09] [INFO ] Computed 438 place invariants in 4 ms
[2021-06-06 02:05:09] [INFO ] Implicit Places using invariants in 547 ms returned []
// Phase 1: matrix 838 rows 998 cols
[2021-06-06 02:05:09] [INFO ] Computed 438 place invariants in 2 ms
[2021-06-06 02:05:11] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 998/2693 places, 838/2413 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-14 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s280 0) (EQ s773 1)), p1:(AND (OR (NEQ s950 0) (NEQ s926 1)) (OR (NEQ s773 0) (NEQ s280 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 762 ms.
Stack based approach found an accepted trace after 1471 steps with 0 reset with depth 1472 and stack size 1425 in 14 ms.
FORMULA ShieldPPPt-PT-040B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-14 finished in 4325 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 2693 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2693/2693 places, 2413/2413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2692 transition count 1855
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 2135 transition count 1855
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1114 place count 2135 transition count 1540
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1744 place count 1820 transition count 1540
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1753 place count 1811 transition count 1531
Iterating global reduction 2 with 9 rules applied. Total rules applied 1762 place count 1811 transition count 1531
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1762 place count 1811 transition count 1523
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1778 place count 1803 transition count 1523
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3136 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3137 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3139 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3341 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3377 place count 1004 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3378 place count 1003 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3379 place count 1002 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3379 place count 1002 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3383 place count 1000 transition count 839
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3384 place count 999 transition count 838
Applied a total of 3384 rules in 537 ms. Remains 999 /2693 variables (removed 1694) and now considering 838/2413 (removed 1575) transitions.
// Phase 1: matrix 838 rows 999 cols
[2021-06-06 02:05:12] [INFO ] Computed 440 place invariants in 3 ms
[2021-06-06 02:05:13] [INFO ] Implicit Places using invariants in 578 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 581 ms to find 2 implicit places.
[2021-06-06 02:05:13] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 838 rows 997 cols
[2021-06-06 02:05:13] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:05:13] [INFO ] Dead Transitions using invariants and state equation in 476 ms returned []
Starting structural reductions, iteration 1 : 997/2693 places, 838/2413 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 34 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2021-06-06 02:05:13] [INFO ] Computed 438 place invariants in 4 ms
[2021-06-06 02:05:14] [INFO ] Implicit Places using invariants in 542 ms returned []
// Phase 1: matrix 836 rows 995 cols
[2021-06-06 02:05:14] [INFO ] Computed 438 place invariants in 1 ms
[2021-06-06 02:05:15] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/2693 places, 836/2413 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s722 0) (EQ s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 701 ms.
Product exploration explored 100000 steps with 4 reset in 859 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 727 ms.
Product exploration explored 100000 steps with 3 reset in 913 ms.
[2021-06-06 02:05:18] [INFO ] Flatten gal took : 39 ms
[2021-06-06 02:05:18] [INFO ] Flatten gal took : 26 ms
[2021-06-06 02:05:18] [INFO ] Time to serialize gal into /tmp/LTL16527766754825902204.gal : 3 ms
[2021-06-06 02:05:18] [INFO ] Time to serialize properties into /tmp/LTL16969228699037462502.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/LTL16527766754825902204.gal, -t, CGAL, -LTL, /tmp/LTL16969228699037462502.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/LTL16527766754825902204.gal -t CGAL -LTL /tmp/LTL16969228699037462502.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2239==0)||(p1114==1))"))))
Formula 0 simplified : !GF"((p2239==0)||(p1114==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.79862e+65 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1290 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.0024,332140,1,0,9,2.21887e+06,24,5,24565,356546,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-040B-15 finished in 21342 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1152491407784491963
[2021-06-06 02:05:33] [INFO ] Too many transitions (2413) to apply POR reductions. Disabling POR matrices.
[2021-06-06 02:05:33] [INFO ] Applying decomposition
[2021-06-06 02:05:33] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1152491407784491963
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/ltsmin1152491407784491963]
[2021-06-06 02:05:33] [INFO ] Flatten gal took : 56 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/graph16878374477632309044.txt, -o, /tmp/graph16878374477632309044.bin, -w, /tmp/graph16878374477632309044.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/graph16878374477632309044.bin, -l, -1, -v, -w, /tmp/graph16878374477632309044.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:05:33] [INFO ] Decomposing Gal with order
[2021-06-06 02:05:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:05:33] [INFO ] Removed a total of 390 redundant transitions.
[2021-06-06 02:05:33] [INFO ] Flatten gal took : 122 ms
[2021-06-06 02:05:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-06-06 02:05:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality15244638538792033442.gal : 12 ms
[2021-06-06 02:05:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality5434157087172810268.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/LTLCardinality15244638538792033442.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5434157087172810268.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality15244638538792033442.gal -t CGAL -LTL /tmp/LTLCardinality5434157087172810268.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((((X("((i31.u716.p2333==0)||(i28.u639.p2093==1))"))&&(G("(i31.u697.p2279==1)")))||(X(X(F("((i31.u716.p2333==0)||(i28.u639.p2093==1))"))))))
Formula 0 simplified : !((X"((i31.u716.p2333==0)||(i28.u639.p2093==1))" & G"(i31.u697.p2279==1)") | XXF"((i31.u716.p2333==0)||(i28.u639.p2093==1))")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1152491407784491963] killed by timeout after 27 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/ltsmin1152491407784491963] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-06-06 02:28:01] [INFO ] Applying decomposition
[2021-06-06 02:28:02] [INFO ] Flatten gal took : 313 ms
[2021-06-06 02:28:02] [INFO ] Decomposing Gal with order
[2021-06-06 02:28:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:28:03] [INFO ] Removed a total of 114 redundant transitions.
[2021-06-06 02:28:04] [INFO ] Flatten gal took : 612 ms
[2021-06-06 02:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 456 ms.
[2021-06-06 02:28:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality2924699966571868761.gal : 70 ms
[2021-06-06 02:28:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality237229857604848910.ltl : 9 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/LTLCardinality2924699966571868761.gal, -t, CGAL, -LTL, /tmp/LTLCardinality237229857604848910.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality2924699966571868761.gal -t CGAL -LTL /tmp/LTLCardinality237229857604848910.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((((X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u669.p2333==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u605.p2093==1))"))&&(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u915.p2279==1)")))||(X(X(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u669.p2333==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u605.p2093==1))"))))))
Formula 0 simplified : !((X"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u669.p2333==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u605.p2093==1))" & G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u915.p2279==1)") | XXF"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u669.p2333==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u605.p2093==1))")
Detected timeout of ITS tools.
[2021-06-06 02:50:34] [INFO ] Flatten gal took : 345 ms
[2021-06-06 02:50:42] [INFO ] Input system was already deterministic with 2413 transitions.
[2021-06-06 02:50:42] [INFO ] Transformed 2693 places.
[2021-06-06 02:50:42] [INFO ] Transformed 2413 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-06-06 02:50:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality15249841976108163918.gal : 17 ms
[2021-06-06 02:50:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality11992993863268821624.ltl : 4 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/LTLCardinality15249841976108163918.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11992993863268821624.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality15249841976108163918.gal -t CGAL -LTL /tmp/LTLCardinality11992993863268821624.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((X("((p2333==0)||(p2093==1))"))&&(G("(p2279==1)")))||(X(X(F("((p2333==0)||(p2093==1))"))))))
Formula 0 simplified : !((X"((p2333==0)||(p2093==1))" & G"(p2279==1)") | XXF"((p2333==0)||(p2093==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, 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 r216-tall-162098205800901"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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