About the Execution of ITS-Tools for PolyORBNT-COL-S10J20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15760.790 | 3600000.00 | 3446225.00 | 157083.10 | FF?F?TFTFT??TTT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390600593.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S10J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390600593
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.4K Apr 12 06:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 06:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 06:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 06:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 10 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 9 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 92K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J20-00
FORMULA_NAME PolyORBNT-COL-S10J20-01
FORMULA_NAME PolyORBNT-COL-S10J20-02
FORMULA_NAME PolyORBNT-COL-S10J20-03
FORMULA_NAME PolyORBNT-COL-S10J20-04
FORMULA_NAME PolyORBNT-COL-S10J20-05
FORMULA_NAME PolyORBNT-COL-S10J20-06
FORMULA_NAME PolyORBNT-COL-S10J20-07
FORMULA_NAME PolyORBNT-COL-S10J20-08
FORMULA_NAME PolyORBNT-COL-S10J20-09
FORMULA_NAME PolyORBNT-COL-S10J20-10
FORMULA_NAME PolyORBNT-COL-S10J20-11
FORMULA_NAME PolyORBNT-COL-S10J20-12
FORMULA_NAME PolyORBNT-COL-S10J20-13
FORMULA_NAME PolyORBNT-COL-S10J20-14
FORMULA_NAME PolyORBNT-COL-S10J20-15
=== Now, execution of the tool begins
BK_START 1589837376152
[2020-05-18 21:29:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 21:29:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 21:29:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 21:29:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2020-05-18 21:29:38] [INFO ] sort/places :
D4->place_482,
Threads->FetchJobB,QueueJobE,NotifyEventJobQueuedE,NotifyEventEndOfCheckSourcesE,NotifyEventEndOfCheckSourcesB,place_523,place_522,place_521,place_520,place_518,place_500,Check_Sources_E,Check_Sources_B,place_782,place_787,Perform_Work_E,Schedule_Task_B,Try_Check_Sources_E,Try_Check_Sources_B,
D5->Schedule_Task_E,
D6->CreatedJobs,
Jobs->f3,f2,f1,AvailableJobId,
Dot->block,mo3,mo2,mo1,mi3,mi2,mi1,cSources,place_462,place_460,place_458,place_456,CanInjectEvent,JobCnt,cJobCnt,
Sources->ModifiedSrc,DataOnSrc,TheSour,
D1->FetchJobE,QueueJobB,NotifyEventJobQueuedB,Perform_Work_B,
[2020-05-18 21:29:38] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2020-05-18 21:29:38] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-05-18 21:29:38] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2020-05-18 21:29:38] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2020-05-18 21:29:38] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2020-05-18 21:29:38] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-05-18 21:29:38] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 52 ms.
[2020-05-18 21:29:38] [INFO ] Computed order based on color domains.
[2020-05-18 21:29:38] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 61 ms.
[2020-05-18 21:29:38] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 114 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5601 resets, run finished after 2529 ms. (steps per millisecond=39 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
[2020-05-18 21:29:41] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2020-05-18 21:29:41] [INFO ] Computed 72 place invariants in 108 ms
[2020-05-18 21:29:41] [INFO ] [Real]Absence check using 65 positive place invariants in 70 ms returned sat
[2020-05-18 21:29:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned unsat
[2020-05-18 21:29:41] [INFO ] [Real]Absence check using 65 positive place invariants in 58 ms returned sat
[2020-05-18 21:29:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2020-05-18 21:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:29:43] [INFO ] [Real]Absence check using state equation in 1694 ms returned sat
[2020-05-18 21:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:29:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 46 ms returned sat
[2020-05-18 21:29:43] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:29:45] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2020-05-18 21:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 21:29:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 429 ms returned sat
[2020-05-18 21:29:46] [INFO ] Deduced a trap composed of 24 places in 539 ms
[2020-05-18 21:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 746 ms
[2020-05-18 21:29:47] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 277 ms.
[2020-05-18 21:29:55] [INFO ] Added : 45 causal constraints over 9 iterations in 8762 ms. Result :sat
[2020-05-18 21:29:55] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned unsat
[2020-05-18 21:29:55] [INFO ] [Real]Absence check using 65 positive place invariants in 44 ms returned sat
[2020-05-18 21:29:55] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned unsat
[2020-05-18 21:29:56] [INFO ] [Real]Absence check using 65 positive place invariants in 4 ms returned unsat
[2020-05-18 21:29:56] [INFO ] [Real]Absence check using 65 positive place invariants in 40 ms returned sat
[2020-05-18 21:29:56] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2020-05-18 21:29:56] [INFO ] [Real]Absence check using 65 positive place invariants in 50 ms returned sat
[2020-05-18 21:29:56] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2020-05-18 21:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:29:58] [INFO ] [Real]Absence check using state equation in 1839 ms returned sat
[2020-05-18 21:29:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:29:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 48 ms returned sat
[2020-05-18 21:29:58] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2020-05-18 21:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 21:30:06] [INFO ] [Nat]Absence check using state equation in 8484 ms returned sat
[2020-05-18 21:30:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 223 ms returned sat
[2020-05-18 21:30:07] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 213 ms.
[2020-05-18 21:30:10] [INFO ] Added : 21 causal constraints over 8 iterations in 3016 ms. Result :sat
[2020-05-18 21:30:10] [INFO ] [Real]Absence check using 65 positive place invariants in 43 ms returned sat
[2020-05-18 21:30:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 19 ms returned sat
[2020-05-18 21:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:12] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2020-05-18 21:30:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:30:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 51 ms returned sat
[2020-05-18 21:30:12] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:30:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:14] [INFO ] [Nat]Absence check using state equation in 2000 ms returned sat
[2020-05-18 21:30:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1428 ms returned sat
[2020-05-18 21:30:16] [INFO ] Deduced a trap composed of 233 places in 620 ms
[2020-05-18 21:30:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 21:30:32] [INFO ] Deduced a trap composed of 7 places in 789 ms
[2020-05-18 21:30:32] [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 closed (> (+ s22 s66 s67 s68 s131 s395 s470) 0)") while checking expression at index 7
[2020-05-18 21:30:32] [INFO ] [Real]Absence check using 65 positive place invariants in 31 ms returned sat
[2020-05-18 21:30:32] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-18 21:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:34] [INFO ] [Real]Absence check using state equation in 1618 ms returned sat
[2020-05-18 21:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:30:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 54 ms returned sat
[2020-05-18 21:30:34] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:37] [INFO ] [Nat]Absence check using state equation in 2388 ms returned sat
[2020-05-18 21:30:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 182 ms returned sat
[2020-05-18 21:30:37] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 229 ms.
[2020-05-18 21:30:38] [INFO ] Added : 19 causal constraints over 4 iterations in 1115 ms. Result :sat
[2020-05-18 21:30:38] [INFO ] [Real]Absence check using 65 positive place invariants in 45 ms returned sat
[2020-05-18 21:30:38] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:40] [INFO ] [Real]Absence check using state equation in 1843 ms returned sat
[2020-05-18 21:30:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:30:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 63 ms returned sat
[2020-05-18 21:30:40] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:43] [INFO ] [Nat]Absence check using state equation in 2909 ms returned sat
[2020-05-18 21:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
[2020-05-18 21:30:44] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 285 ms.
[2020-05-18 21:30:45] [INFO ] Added : 18 causal constraints over 4 iterations in 1944 ms. Result :sat
[2020-05-18 21:30:45] [INFO ] [Real]Absence check using 65 positive place invariants in 44 ms returned sat
[2020-05-18 21:30:45] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned unsat
[2020-05-18 21:30:46] [INFO ] [Real]Absence check using 65 positive place invariants in 41 ms returned sat
[2020-05-18 21:30:46] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:47] [INFO ] [Real]Absence check using state equation in 1831 ms returned sat
[2020-05-18 21:30:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:30:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 55 ms returned sat
[2020-05-18 21:30:48] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:30:49] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2020-05-18 21:30:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2020-05-18 21:30:50] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 226 ms.
[2020-05-18 21:31:02] [INFO ] Added : 87 causal constraints over 19 iterations in 12703 ms. Result :sat
[2020-05-18 21:31:03] [INFO ] Deduced a trap composed of 19 places in 489 ms
[2020-05-18 21:31:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1223 ms
[2020-05-18 21:31:03] [INFO ] [Real]Absence check using 65 positive place invariants in 51 ms returned sat
[2020-05-18 21:31:03] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:05] [INFO ] [Real]Absence check using state equation in 1819 ms returned sat
[2020-05-18 21:31:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:31:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 54 ms returned sat
[2020-05-18 21:31:05] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:08] [INFO ] [Nat]Absence check using state equation in 2827 ms returned sat
[2020-05-18 21:31:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2020-05-18 21:31:09] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 202 ms.
[2020-05-18 21:31:10] [INFO ] Added : 18 causal constraints over 4 iterations in 1896 ms. Result :sat
[2020-05-18 21:31:10] [INFO ] [Real]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:31:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:12] [INFO ] [Real]Absence check using state equation in 1796 ms returned sat
[2020-05-18 21:31:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:31:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 53 ms returned sat
[2020-05-18 21:31:12] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:15] [INFO ] [Nat]Absence check using state equation in 2171 ms returned sat
[2020-05-18 21:31:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2020-05-18 21:31:15] [INFO ] Deduced a trap composed of 24 places in 457 ms
[2020-05-18 21:31:16] [INFO ] Deduced a trap composed of 62 places in 554 ms
[2020-05-18 21:31:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1271 ms
[2020-05-18 21:31:16] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 223 ms.
[2020-05-18 21:31:30] [INFO ] Added : 89 causal constraints over 18 iterations in 13987 ms. Result :sat
[2020-05-18 21:31:31] [INFO ] Deduced a trap composed of 19 places in 582 ms
[2020-05-18 21:31:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1254 ms
[2020-05-18 21:31:31] [INFO ] [Real]Absence check using 65 positive place invariants in 49 ms returned sat
[2020-05-18 21:31:31] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned unsat
[2020-05-18 21:31:31] [INFO ] [Real]Absence check using 65 positive place invariants in 40 ms returned sat
[2020-05-18 21:31:31] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:33] [INFO ] [Real]Absence check using state equation in 1471 ms returned sat
[2020-05-18 21:31:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:31:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 39 ms returned sat
[2020-05-18 21:31:33] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-18 21:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:35] [INFO ] [Nat]Absence check using state equation in 2439 ms returned sat
[2020-05-18 21:31:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 99 ms returned sat
[2020-05-18 21:31:36] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 268 ms.
[2020-05-18 21:31:37] [INFO ] Added : 16 causal constraints over 4 iterations in 1775 ms. Result :sat
[2020-05-18 21:31:38] [INFO ] [Real]Absence check using 65 positive place invariants in 53 ms returned sat
[2020-05-18 21:31:38] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 28 ms returned sat
[2020-05-18 21:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:39] [INFO ] [Real]Absence check using state equation in 1851 ms returned sat
[2020-05-18 21:31:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:31:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 49 ms returned sat
[2020-05-18 21:31:40] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:31:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:41] [INFO ] [Nat]Absence check using state equation in 1846 ms returned sat
[2020-05-18 21:31:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2020-05-18 21:31:42] [INFO ] Deduced a trap composed of 115 places in 644 ms
[2020-05-18 21:31:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 794 ms
[2020-05-18 21:31:42] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 181 ms.
[2020-05-18 21:31:43] [INFO ] Added : 14 causal constraints over 3 iterations in 913 ms. Result :sat
[2020-05-18 21:31:43] [INFO ] [Real]Absence check using 65 positive place invariants in 50 ms returned sat
[2020-05-18 21:31:43] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:45] [INFO ] [Real]Absence check using state equation in 1837 ms returned sat
[2020-05-18 21:31:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:31:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 54 ms returned sat
[2020-05-18 21:31:46] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:31:47] [INFO ] [Nat]Absence check using state equation in 1982 ms returned sat
[2020-05-18 21:31:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 391 ms returned sat
[2020-05-18 21:31:48] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 205 ms.
[2020-05-18 21:31:55] [INFO ] Added : 45 causal constraints over 9 iterations in 6768 ms. Result :sat
[2020-05-18 21:31:55] [INFO ] Deduced a trap composed of 20 places in 539 ms
[2020-05-18 21:31:56] [INFO ] Deduced a trap composed of 19 places in 454 ms
[2020-05-18 21:31:58] [INFO ] Deduced a trap composed of 24 places in 384 ms
[2020-05-18 21:32:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4980 ms
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive place invariants in 50 ms returned sat
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned unsat
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive place invariants in 45 ms returned sat
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned unsat
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned unsat
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive place invariants in 43 ms returned sat
[2020-05-18 21:32:00] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2020-05-18 21:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:02] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2020-05-18 21:32:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:32:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 51 ms returned sat
[2020-05-18 21:32:02] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:04] [INFO ] [Nat]Absence check using state equation in 2014 ms returned sat
[2020-05-18 21:32:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 113 ms returned sat
[2020-05-18 21:32:05] [INFO ] Deduced a trap composed of 13 places in 457 ms
[2020-05-18 21:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2020-05-18 21:32:05] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 171 ms.
[2020-05-18 21:32:22] [INFO ] Added : 130 causal constraints over 26 iterations in 17152 ms. Result :unknown
[2020-05-18 21:32:22] [INFO ] [Real]Absence check using 65 positive place invariants in 53 ms returned sat
[2020-05-18 21:32:22] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned unsat
[2020-05-18 21:32:22] [INFO ] [Real]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:32:22] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:24] [INFO ] [Real]Absence check using state equation in 1744 ms returned sat
[2020-05-18 21:32:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:32:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 43 ms returned sat
[2020-05-18 21:32:24] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:26] [INFO ] [Nat]Absence check using state equation in 1916 ms returned sat
[2020-05-18 21:32:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2020-05-18 21:32:26] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 199 ms.
[2020-05-18 21:32:31] [INFO ] Added : 45 causal constraints over 9 iterations in 4931 ms. Result :sat
[2020-05-18 21:32:32] [INFO ] Deduced a trap composed of 19 places in 630 ms
[2020-05-18 21:32:32] [INFO ] Deduced a trap composed of 24 places in 552 ms
[2020-05-18 21:32:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1617 ms
[2020-05-18 21:32:33] [INFO ] [Real]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:32:33] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:35] [INFO ] [Real]Absence check using state equation in 1730 ms returned sat
[2020-05-18 21:32:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:32:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 33 ms returned sat
[2020-05-18 21:32:35] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2020-05-18 21:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:37] [INFO ] [Nat]Absence check using state equation in 2066 ms returned sat
[2020-05-18 21:32:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 545 ms returned sat
[2020-05-18 21:32:37] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 154 ms.
[2020-05-18 21:32:41] [INFO ] Added : 36 causal constraints over 8 iterations in 4048 ms. Result :sat
[2020-05-18 21:32:42] [INFO ] Deduced a trap composed of 233 places in 595 ms
[2020-05-18 21:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1116 ms
[2020-05-18 21:32:43] [INFO ] [Real]Absence check using 65 positive place invariants in 50 ms returned sat
[2020-05-18 21:32:43] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:44] [INFO ] [Real]Absence check using state equation in 1725 ms returned sat
[2020-05-18 21:32:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:32:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 42 ms returned sat
[2020-05-18 21:32:45] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:46] [INFO ] [Nat]Absence check using state equation in 1788 ms returned sat
[2020-05-18 21:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 134 ms returned sat
[2020-05-18 21:32:47] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 182 ms.
[2020-05-18 21:32:54] [INFO ] Added : 84 causal constraints over 17 iterations in 7506 ms. Result :sat
[2020-05-18 21:32:54] [INFO ] Deduced a trap composed of 19 places in 438 ms
[2020-05-18 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1248 ms
[2020-05-18 21:32:55] [INFO ] [Real]Absence check using 65 positive place invariants in 51 ms returned sat
[2020-05-18 21:32:55] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:57] [INFO ] [Real]Absence check using state equation in 1836 ms returned sat
[2020-05-18 21:32:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:32:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 30 ms returned sat
[2020-05-18 21:32:57] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-18 21:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:32:59] [INFO ] [Nat]Absence check using state equation in 1963 ms returned sat
[2020-05-18 21:32:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2020-05-18 21:33:00] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 238 ms.
[2020-05-18 21:33:04] [INFO ] Added : 45 causal constraints over 9 iterations in 4827 ms. Result :sat
[2020-05-18 21:33:05] [INFO ] Deduced a trap composed of 19 places in 658 ms
[2020-05-18 21:33:06] [INFO ] Deduced a trap composed of 24 places in 542 ms
[2020-05-18 21:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1638 ms
[2020-05-18 21:33:06] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned unsat
[2020-05-18 21:33:06] [INFO ] [Real]Absence check using 65 positive place invariants in 49 ms returned sat
[2020-05-18 21:33:06] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:08] [INFO ] [Real]Absence check using state equation in 1797 ms returned sat
[2020-05-18 21:33:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:33:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 53 ms returned sat
[2020-05-18 21:33:08] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:09] [INFO ] [Nat]Absence check using state equation in 1218 ms returned unsat
[2020-05-18 21:33:09] [INFO ] [Real]Absence check using 65 positive place invariants in 55 ms returned sat
[2020-05-18 21:33:09] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:11] [INFO ] [Real]Absence check using state equation in 1748 ms returned sat
[2020-05-18 21:33:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:33:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 50 ms returned sat
[2020-05-18 21:33:11] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:14] [INFO ] [Nat]Absence check using state equation in 2213 ms returned sat
[2020-05-18 21:33:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 139 ms returned sat
[2020-05-18 21:33:14] [INFO ] Deduced a trap composed of 19 places in 506 ms
[2020-05-18 21:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 664 ms
[2020-05-18 21:33:15] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 189 ms.
[2020-05-18 21:33:28] [INFO ] Added : 112 causal constraints over 23 iterations in 13767 ms. Result :sat
[2020-05-18 21:33:28] [INFO ] [Real]Absence check using 65 positive place invariants in 51 ms returned sat
[2020-05-18 21:33:28] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned unsat
[2020-05-18 21:33:28] [INFO ] [Real]Absence check using 65 positive place invariants in 50 ms returned sat
[2020-05-18 21:33:28] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned unsat
[2020-05-18 21:33:29] [INFO ] [Real]Absence check using 65 positive place invariants in 65 ms returned sat
[2020-05-18 21:33:29] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned unsat
[2020-05-18 21:33:29] [INFO ] [Real]Absence check using 65 positive place invariants in 51 ms returned sat
[2020-05-18 21:33:29] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:30] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2020-05-18 21:33:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:33:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:33:31] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:33] [INFO ] [Nat]Absence check using state equation in 1933 ms returned sat
[2020-05-18 21:33:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 181 ms returned sat
[2020-05-18 21:33:33] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 168 ms.
[2020-05-18 21:33:44] [INFO ] Added : 130 causal constraints over 27 iterations in 11530 ms. Result :sat
[2020-05-18 21:33:45] [INFO ] Deduced a trap composed of 19 places in 420 ms
[2020-05-18 21:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3276 ms
[2020-05-18 21:33:48] [INFO ] [Real]Absence check using 65 positive place invariants in 60 ms returned sat
[2020-05-18 21:33:48] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2020-05-18 21:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:49] [INFO ] [Real]Absence check using state equation in 1683 ms returned sat
[2020-05-18 21:33:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:33:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 53 ms returned sat
[2020-05-18 21:33:50] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2020-05-18 21:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:33:51] [INFO ] [Nat]Absence check using state equation in 1797 ms returned sat
[2020-05-18 21:33:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 161 ms returned sat
[2020-05-18 21:33:52] [INFO ] Deduced a trap composed of 57 places in 518 ms
[2020-05-18 21:33:53] [INFO ] Deduced a trap composed of 150 places in 404 ms
[2020-05-18 21:33:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1132 ms
[2020-05-18 21:33:53] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 156 ms.
[2020-05-18 21:33:58] [INFO ] Added : 45 causal constraints over 9 iterations in 5095 ms. Result :sat
[2020-05-18 21:33:58] [INFO ] Deduced a trap composed of 69 places in 428 ms
[2020-05-18 21:34:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 21:34:10] [INFO ] Deduced a trap composed of 7 places in 663 ms
[2020-05-18 21:34:10] [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 closed (> (+ s22 s66 s67 s68 s131 s395 s470) 0)") while checking expression at index 34
[2020-05-18 21:34:10] [INFO ] [Real]Absence check using 65 positive place invariants in 49 ms returned sat
[2020-05-18 21:34:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:12] [INFO ] [Real]Absence check using state equation in 1789 ms returned sat
[2020-05-18 21:34:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:34:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:34:12] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:15] [INFO ] [Nat]Absence check using state equation in 2386 ms returned sat
[2020-05-18 21:34:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2020-05-18 21:34:15] [INFO ] Deduced a trap composed of 12 places in 609 ms
[2020-05-18 21:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2020-05-18 21:34:16] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 210 ms.
[2020-05-18 21:34:27] [INFO ] Added : 89 causal constraints over 19 iterations in 11494 ms. Result :sat
[2020-05-18 21:34:27] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned unsat
[2020-05-18 21:34:27] [INFO ] [Real]Absence check using 65 positive place invariants in 8 ms returned unsat
[2020-05-18 21:34:27] [INFO ] [Real]Absence check using 65 positive place invariants in 55 ms returned sat
[2020-05-18 21:34:27] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 17 ms returned sat
[2020-05-18 21:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:29] [INFO ] [Real]Absence check using state equation in 1837 ms returned sat
[2020-05-18 21:34:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:34:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:34:29] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2020-05-18 21:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:32] [INFO ] [Nat]Absence check using state equation in 2594 ms returned sat
[2020-05-18 21:34:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2020-05-18 21:34:32] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 152 ms.
[2020-05-18 21:34:33] [INFO ] Added : 14 causal constraints over 3 iterations in 1021 ms. Result :sat
[2020-05-18 21:34:33] [INFO ] [Real]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:34:33] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:35] [INFO ] [Real]Absence check using state equation in 1763 ms returned sat
[2020-05-18 21:34:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:34:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 55 ms returned sat
[2020-05-18 21:34:35] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-18 21:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:38] [INFO ] [Nat]Absence check using state equation in 3085 ms returned sat
[2020-05-18 21:34:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2020-05-18 21:34:39] [INFO ] Computed and/alt/rep : 1639/67922/1630 causal constraints in 173 ms.
[2020-05-18 21:34:40] [INFO ] Added : 29 causal constraints over 6 iterations in 1824 ms. Result :sat
[2020-05-18 21:34:41] [INFO ] Deduced a trap composed of 247 places in 560 ms
[2020-05-18 21:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 853 ms
[2020-05-18 21:34:41] [INFO ] [Real]Absence check using 65 positive place invariants in 52 ms returned sat
[2020-05-18 21:34:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-18 21:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:43] [INFO ] [Real]Absence check using state equation in 1700 ms returned sat
[2020-05-18 21:34:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:34:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 41 ms returned sat
[2020-05-18 21:34:43] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2020-05-18 21:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:34:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 21:34:54] [INFO ] [Nat]Absence check using state equation in 10538 ms returned unknown
Successfully simplified 18 atomic propositions for a total of 19 simplifications.
[2020-05-18 21:34:54] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-05-18 21:34:54] [INFO ] Flatten gal took : 324 ms
FORMULA PolyORBNT-COL-S10J20-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 21:34:54] [INFO ] Flatten gal took : 213 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 21:34:55] [INFO ] Applying decomposition
[2020-05-18 21:34:55] [INFO ] Flatten gal took : 134 ms
[2020-05-18 21:34:55] [INFO ] Input system was already deterministic with 1650 transitions.
[2020-05-18 21:34:55] [INFO ] Too many transitions (1650) to apply POR reductions. Disabling POR matrices.
[2020-05-18 21:34:55] [INFO ] Built C files in 643ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11443246364924932470.txt, -o, /tmp/graph11443246364924932470.bin, -w, /tmp/graph11443246364924932470.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11443246364924932470.bin, -l, -1, -v, -w, /tmp/graph11443246364924932470.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 21:34:55] [INFO ] Decomposing Gal with order
[2020-05-18 21:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 21:34:56] [INFO ] Removed a total of 716 redundant transitions.
[2020-05-18 21:34:56] [INFO ] Flatten gal took : 525 ms
[2020-05-18 21:34:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 233 labels/synchronizations in 30 ms.
[2020-05-18 21:34:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 32 ms
[2020-05-18 21:34:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((F(G(G((X("(((((((((((((((((((((gu12.QueueJobB_0+gu12.QueueJobB_1)+gu12.QueueJobB_2)+gu12.QueueJobB_3)+gu12.QueueJobB_4)+gu12.QueueJobB_5)+gu12.QueueJobB_6)+gu12.QueueJobB_7)+gu12.QueueJobB_8)+gu12.QueueJobB_9)+gu12.QueueJobB_10)+gu12.QueueJobB_11)+gu12.QueueJobB_12)+gu12.QueueJobB_13)+gu12.QueueJobB_14)+gu12.QueueJobB_15)+gu12.QueueJobB_16)+gu12.QueueJobB_17)+gu12.QueueJobB_18)+gu12.QueueJobB_19)+gu12.QueueJobB_20)>gu12.place_456_0)"))||("(gi0.gu49.NotifyEventJobQueuedE_0>gi0.gu49.JobCnt_0)"))))))
Formula 0 simplified : !FG("(gi0.gu49.NotifyEventJobQueuedE_0>gi0.gu49.JobCnt_0)" | X"(((((((((((((((((((((gu12.QueueJobB_0+gu12.QueueJobB_1)+gu12.QueueJobB_2)+gu12.QueueJobB_3)+gu12.QueueJobB_4)+gu12.QueueJobB_5)+gu12.QueueJobB_6)+gu12.QueueJobB_7)+gu12.QueueJobB_8)+gu12.QueueJobB_9)+gu12.QueueJobB_10)+gu12.QueueJobB_11)+gu12.QueueJobB_12)+gu12.QueueJobB_13)+gu12.QueueJobB_14)+gu12.QueueJobB_15)+gu12.QueueJobB_16)+gu12.QueueJobB_17)+gu12.QueueJobB_18)+gu12.QueueJobB_19)+gu12.QueueJobB_20)>gu12.place_456_0)")
Compilation finished in 19088 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 62 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([]([](( X((LTLAP0==true))) || ( (LTLAP1==true)) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([]([](( X((LTLAP0==true))) || ( (LTLAP1==true)) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([]([](( X((LTLAP0==true))) || ( (LTLAP1==true)) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-18 21:56:44] [INFO ] Applying decomposition
[2020-05-18 21:56:45] [INFO ] Flatten gal took : 558 ms
[2020-05-18 21:56:45] [INFO ] Decomposing Gal with order
[2020-05-18 21:56:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 21:56:46] [INFO ] Removed a total of 10661 redundant transitions.
[2020-05-18 21:56:46] [INFO ] Flatten gal took : 874 ms
[2020-05-18 21:56:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 466 ms.
[2020-05-18 21:56:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 25 ms
[2020-05-18 21:56:47] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((F(G(G((X("(((((((((((((((((((((gD10.QueueJobB_0+gD11.QueueJobB_1)+gD12.QueueJobB_2)+gD13.QueueJobB_3)+gD14.QueueJobB_4)+gD15.QueueJobB_5)+gD16.QueueJobB_6)+gD17.QueueJobB_7)+gD18.QueueJobB_8)+gD19.QueueJobB_9)+gD110.QueueJobB_10)+gD111.QueueJobB_11)+gD112.QueueJobB_12)+gD113.QueueJobB_13)+gD114.QueueJobB_14)+gD115.QueueJobB_15)+gD116.QueueJobB_16)+gD117.QueueJobB_17)+gD118.QueueJobB_18)+gD119.QueueJobB_19)+gD120.QueueJobB_20)>gplace_456.place_456_0)"))||("(gNotifyEventJobQueuedE.NotifyEventJobQueuedE_0>gJobCnt.JobCnt_0)"))))))
Formula 0 simplified : !FG("(gNotifyEventJobQueuedE.NotifyEventJobQueuedE_0>gJobCnt.JobCnt_0)" | X"(((((((((((((((((((((gD10.QueueJobB_0+gD11.QueueJobB_1)+gD12.QueueJobB_2)+gD13.QueueJobB_3)+gD14.QueueJobB_4)+gD15.QueueJobB_5)+gD16.QueueJobB_6)+gD17.QueueJobB_7)+gD18.QueueJobB_8)+gD19.QueueJobB_9)+gD110.QueueJobB_10)+gD111.QueueJobB_11)+gD112.QueueJobB_12)+gD113.QueueJobB_13)+gD114.QueueJobB_14)+gD115.QueueJobB_15)+gD116.QueueJobB_16)+gD117.QueueJobB_17)+gD118.QueueJobB_18)+gD119.QueueJobB_19)+gD120.QueueJobB_20)>gplace_456.place_456_0)")
Detected timeout of ITS tools.
[2020-05-18 22:18:35] [INFO ] Flatten gal took : 716 ms
[2020-05-18 22:18:37] [INFO ] Input system was already deterministic with 1650 transitions.
[2020-05-18 22:18:37] [INFO ] Transformed 474 places.
[2020-05-18 22:18:37] [INFO ] Transformed 1650 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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
[2020-05-18 22:19:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 25 ms
[2020-05-18 22:19:07] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 11 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.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 : !((F(G(G((X("(((((((((((((((((((((QueueJobB_0+QueueJobB_1)+QueueJobB_2)+QueueJobB_3)+QueueJobB_4)+QueueJobB_5)+QueueJobB_6)+QueueJobB_7)+QueueJobB_8)+QueueJobB_9)+QueueJobB_10)+QueueJobB_11)+QueueJobB_12)+QueueJobB_13)+QueueJobB_14)+QueueJobB_15)+QueueJobB_16)+QueueJobB_17)+QueueJobB_18)+QueueJobB_19)+QueueJobB_20)>place_456_0)"))||("(NotifyEventJobQueuedE_0>JobCnt_0)"))))))
Formula 0 simplified : !FG("(NotifyEventJobQueuedE_0>JobCnt_0)" | X"(((((((((((((((((((((QueueJobB_0+QueueJobB_1)+QueueJobB_2)+QueueJobB_3)+QueueJobB_4)+QueueJobB_5)+QueueJobB_6)+QueueJobB_7)+QueueJobB_8)+QueueJobB_9)+QueueJobB_10)+QueueJobB_11)+QueueJobB_12)+QueueJobB_13)+QueueJobB_14)+QueueJobB_15)+QueueJobB_16)+QueueJobB_17)+QueueJobB_18)+QueueJobB_19)+QueueJobB_20)>place_456_0)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
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"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J20, 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 r126-tajo-158961390600593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 '
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 ;